#include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<string>

 #define inf 1000000000

 #define maxn 200000+5

 #define maxm 200000+5

 #define eps 1e-10

 #define ll long long

 #define pa pair<int,int>

 #define for0(i,n) for(int i=0;i<=(n);i++)

 #define for1(i,n) for(int i=1;i<=(n);i++)

 #define for2(i,x,y) for(int i=(x);i<=(y);i++)

 #define for3(i,x,y) for(int i=(x);i>=(y);i--)

 #define for4(i,x) for(int i=head[x],y=e[i].go;i;i=e[i].next,y=e[i].go)

 #define for5(n,m) for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)

 #define mod 1000000007

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

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

     return x*f;

 }

 int  n,m,s,t,cut[][],a[maxm],b[maxm],c[maxm],maxflow,tot=,head[maxn],cur[maxn],h[maxn];

 queue<int>q;

 bool v[maxn];

 struct edge{int go,next,v;}e[maxm];

 inline void add(int x,int y,int v)

 {

     e[++tot]=(edge){y,head[x],v};head[x]=tot;

     e[++tot]=(edge){x,head[y],};head[y]=tot;

 }

 bool bfs()

 {

     for(int i=;i<=n;i++)h[i]=-;

     q.push(s);h[s]=;

     while(!q.empty())

     {

         int x=q.front();q.pop();

         for(int i=head[x];i;i=e[i].next)

          if(e[i].v&&h[e[i].go]==-)

          {

             h[e[i].go]=h[x]+;q.push(e[i].go);

          }

     }

     return h[t]!=-;

 }

 int dfs(int x,int f)

 {

     if(x==t) return f;

     int tmp,used=;

     for(int i=cur[x];i;i=e[i].next)

      if(e[i].v&&h[e[i].go]==h[x]+)

     {

         tmp=dfs(e[i].go,min(e[i].v,f-used));

         e[i].v-=tmp;if(e[i].v)cur[x]=i;

         e[i^].v+=tmp;used+=tmp;

         if(used==f)return f;      

     }

     if(!used) h[x]=-;

     return used;

 }

 inline void dfs(int x)

 {

     v[x]=;

     for4(i,x)if(e[i].v&&!v[y])dfs(y);

 }

 void dinic()

 {

     maxflow=;

     while(bfs())

     {

         for (int i=;i<=n;i++)cur[i]=head[i];maxflow+=dfs(s,inf);

     }

 }

 inline void solve(int l,int r)

 {

     if(l==r)return;

     s=b[l];t=b[r];

     for1(i,tot)e[i].v=a[i];

     dinic();

     for1(i,n)v[i]=;

     dfs(s);

     for1(i,n)if(v[i])for1(j,n)if(!v[j])cut[i][j]=cut[j][i]=min(cut[i][j],maxflow);

     int t1=l-,t2=r+;

     for2(i,l,r)if(v[b[i]])c[++t1]=b[i];else c[--t2]=b[i];

     for2(i,l,r)b[i]=c[i];

     solve(l,t1);solve(t2,r);

 }

 int main()

 {

     int T=read();

     while(T--)

     {

         n=read();m=read();

         for1(i,n)head[i]=;tot=;

         for1(i,m)

         {

             int x=read(),y=read(),w=read();

             add(x,y,w);add(y,x,w);

         }

         for1(i,tot)a[i]=e[i].v;

         for1(i,n)b[i]=i;

         for1(i,n)for1(j,n)cut[i][j]=inf;

         solve(,n);

         int q=read();

         while(q--)

         {

             int x=read(),ans=;

             for1(i,n)for2(j,i+,n)if(cut[i][j]<=x)ans++;

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

         }

         printf("\n");

     }

     return ;

 }