#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 typedef long long ll;

 int n,m,k;

 int p[], num[];

 ll ans[];

 struct node

 {

     int u,v,w;

     bool operator< (const node& rhs) const

     {

         return w<rhs.w;

     }

 }e[];

 struct Node

 {

     int id;

     int val;

     bool operator< (const Node& rhs) const

     {

         return val<rhs.val;

     }

 }query[];

 int finds(int x)

 {

     return x==p[x]?x:p[x] = finds(p[x]);

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

     int T;

     scanf("%d",&T);

     while(T--)

     {

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

         for(int i=;i<=n;i++)  {p[i] = i; num[i] = ;}

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

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

         sort(e+,e+m+);

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

         {

             scanf("%d",&query[i].val);

             query[i].id = i;

         }

         sort(query+,query+k+);

         query[].id = ;

         ll tmp = ;

         int pos = ;

         ans[] = ;

         for(int i=;i<=m && pos<=k;i++)

         {

             while(e[i].w>query[pos].val && pos<=k)

             {

                 ans[query[pos].id] = ans[query[pos-].id];

                 pos++;

             }

             while(e[i].w<=query[pos].val && i<=m)

             {

                 int x = finds(e[i].u);

                 int y = finds(e[i].v);

                 if(x!=y)

                 {

                     p[x] = y;

                     tmp = tmp-num[y]*(num[y]-)-num[x]*(num[x]-);

                     num[y] += num[x];

                     tmp = tmp+num[y]*(num[y]-);

                 }

                 i++;

             }

             ans[query[pos].id] = tmp;

             pos++;

             i--;

         }

         while(pos<=k)

         {

             ans[query[pos].id] = ans[query[pos-].id];

             pos++;

         }

         for(int i=;i<=k;i++)  printf("%lld\n",ans[i]);

     }

     return ;

 }