//看看会不会爆int!数组会不会少了一维！//取物问题一定要小心先手胜利的条件#include <bits/stdc++.h>using namespace std;#define LL long long#define ALL(a) a.begin(), a.end()#define pb push_back#define mk make_pair#define fi first#define se secondconst int maxn = 1e5 + 5;const int maxm = 5e5 + 5;int n, m, Q;pair<int, pair<int, int> > p[maxm];///边pair<int, int> q[maxn];///询问int par[maxn];LL sum[maxn], ans[maxn];int pfind(int x){    if (x == par[x]) return x;    return par[x] = pfind(par[x]);}int main(){    while (scanf("%d%d%d", &n, &m, &Q) == 3){        for (int i = 1; i <= m; i++){            int u, v, val;            scanf("%d%d%d", &u, &v, &val);            p[i] = mk(val, mk(u, v));        }        sort(p + 1, p + 1 + m);        memset(sum, 0, sizeof(sum));        for (int i = 1; i <= n; i++) par[i] = i, sum[i] = 1;        for (int i = 1; i <= Q; i++){            int val; scanf("%d", &val);            q[i] = mk(val, i);        }        sort(q + 1, q + 1 + Q);        int j = 1; LL cnt = 0;        for (int i = 1; i <= m && j <= Q; ){            while (i <= m && p[i].first <= q[j].first){                int pa = pfind(p[i].second.first);                int pb = pfind(p[i].second.second);                i++;                if (pa == pb) continue;                cnt += sum[pa] * sum[pb];                ///printf("sum[%d] = %I64d sum[%d] = %I64d\n", pa, sum[pa], pb, sum[pb]);                par[pa] = pb;                sum[pb] += sum[pa];            }            while (j <= Q && q[j].first < p[i].first){                ans[q[j].second] = cnt;                j++;            }        }        while (j <= Q){            ans[q[j].second] = cnt;            j++;        }        for (int i = 1; i <= Q; i++){            printf("%I64d\n", ans[i]);        }    }    return 0;}