#include <fstream>
#include <algorithm>

using namespace std;

const int N = 5e4;
const int M = 1e6;
const int K = 1e5;

struct muchie
{
    unsigned short int x, y, l;

};

struct vapor
{
    unsigned short int l;
    int poz;
};
muchie e[M];

vapor v[K];
unsigned short int rez[K];

int t[N+1], nr[N+1];

int radacina(int x)
{
    if (t[x] == 0)
    {
        return x;
    }
    t[x] = radacina(t[x]);
    return t[x];
}

void reuniune(int x, int y)
{
    int rx = radacina(x);
    int ry = radacina(y);
    if (nr[rx] < nr[ry])
    {
        t[rx] = ry;
        nr[ry] += nr[rx];
    }
    else
    {
        t[ry] = rx;
        nr[rx] += nr[ry];
    }
}

bool interogare(int x, int y)
{
    return (radacina(x) == radacina(y));
}

bool cmp_e(muchie e1, muchie e2)
{
    return (e1.l > e2.l);
}

bool cmp_v(vapor v1, vapor v2)
{
    return (v1.l > v2.l);
}

int main()
{

    ifstream in("flota.in");
    ofstream out("flota.out");

    int n, m, k;
    in >> n >> m >> k;
    for (int i = 1; i <= n; i++)
    {
        nr[i] = 1;
    }
    for (int i = 0; i < m; i++)
    {
        in >> e[i].x >> e[i].y >> e[i].l;
    }
    sort(e, e + m, cmp_e);

    for (int i = 0; i < k; i++)
    {
        in >> v[i].l;
        v[i].poz = i;
    }
    sort(v, v + k, cmp_v);

    unsigned short int nr_v = n;
    int i_e = 0;
    for (int i = 0; i < k; i++)
    {
        while (i_e < m && e[i_e].l >= v[i].l)
        {
            if (!interogare(e[i_e].x, e[i_e].y))
            {
                reuniune(e[i_e].x, e[i_e].y);
                nr_v--;
            }
            i_e++;
        }
        rez[v[i].poz] = nr_v;
    }
    for (int i = 0; i < k; i++)
    {
        out << rez[i] << "\n";
    }
    in.close();
    out.close();
    return 0;

}