// It is made by XZZ

 #include<cstdio>

 #include<algorithm>

 using namespace std;

 #define rep(a,b,c) for(rg int a=b;a<=c;a++)

 #define drep(a,b,c) for(rg int a=b;a>=c;a--)

 #define erep(a,b) for(rg int a=fir[b];a;a=nxt[a])

 #define il inline

 #define rg register

 #define vd void

 typedef long long ll;

 il int gi(){

     rg int x=;rg char ch=getchar();

     while(ch<''||ch>'')ch=getchar();

     while(ch>=''&&ch<='')x=x*+ch-'',ch=getchar();

     return x;

 }

 const int maxn=,maxm=;

 struct edge{int a,b,c;}E[maxm];

 bool operator < (edge a,edge b){return a.c<b.c;}

 int fa[maxn];ll siz[maxn],ans;

 struct qq{int q,id;ll ans;}Q[];

 il bool cmpq1(qq a,qq b){return a.q<b.q;}

 il bool cmpq2(qq a,qq b){return a.id<b.id;}

 il int hd(int a){

     if(a==fa[a])return a;

     else return fa[a]=hd(fa[a]);

 }

 il vd Union(int a,int b){

     rg int A=hd(a),B=hd(b);

     if(A^B)ans+=siz[A]*siz[B],siz[A]+=siz[B],fa[B]=A;

 }

 int main(){

     rg int n=gi(),m=gi(),q=gi();

     rep(i,,m)E[i].a=gi(),E[i].b=gi(),E[i].c=gi();

     sort(E+,E+m+);

     rep(i,,n)fa[i]=i,siz[i]=;

     rep(i,,q)Q[i]=(qq){gi(),i};

     sort(Q+,Q+q+,cmpq1);

     rg int NOW=;

     rep(i,,q){

     while(E[NOW].c<=Q[i].q)Union(E[NOW].a,E[NOW].b),++NOW;

     Q[i].ans=ans;

     }

     sort(Q+,Q+q+,cmpq2);

     rep(i,,q)printf("%lld\n",Q[i].ans);

     return ;

 }