#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

int n,m,q,fa[],p[],cnt;

struct node

{

    int u,v,w;

}e[];

bool cmp(node a,node b)

{

    return a.w > b.w;

}

int find(int x)

{

    if (x == fa[x])

        return x;

    return fa[x] = find(fa[x]);

}

bool cmp2(int x,int y)

{

    return x > y;

}

int main()

{

    scanf("%d%d%d",&n,&m,&q);

    for (int i = ; i <= n; i++)

        fa[i] = i;

    for (int i = ; i <= m; i++)

        scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].w);

    sort(e + ,e +  + m,cmp);

    for (int i = ; i <= m; i++)

    {

        int fu = find(e[i].u),fv = find(e[i].v);

        if (fu != fv)

        {

            fa[fu] = fv;

            p[++cnt] = e[i].w;

        }

    }

    sort(p + ,p +  + cnt,cmp2);

    while (q--)

    {

        int temp;

        scanf("%d",&temp);

        int l = ,r = cnt,ans = ;

        while (l <= r)

        {

            int mid = (l + r) >> ;

            if (p[mid] >= temp)

            {

                ans = mid;

                l = mid + ;

            }

            else

                r = mid - ;

        }

        printf("%d\n",n - ans);

    }

    return ;

}