#include<set>

 #include<cmath>

 #include<queue>

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #define trav(u,i) for(int i=front[u];i;i=e[i].nxt)

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

 using namespace std;

 typedef long long ll;

 const int N = 2e3+;

 const int inf = 1e9;

 ll read() {

     char c=getchar();

     ll f=,x=;

     while(!isdigit(c)) {

         if(c=='-') f=-; c=getchar();

     }

     while(isdigit(c))

         x=x*+c-'',c=getchar();

     return x*f;

 }

 struct Edge {

     int u,v,cap,flow;

 };

 struct Dinic {

     int n,m,s,t;

     int d[N],cur[N],vis[N];

     vector<int> g[N];

     vector<Edge> es;

     queue<int> q;

     void init(int n) {

         this->n=n;

         es.clear();

         FOR(i,,n) g[i].clear();

     }

     void clear() {

         FOR(i,,(int)es.size()-) es[i].flow=;

     }

     void AddEdge(int u,int v,int w) {

         es.push_back((Edge){u,v,w,});

         es.push_back((Edge){v,u,,});

         m=es.size();

         g[u].push_back(m-);

         g[v].push_back(m-);

     }

     int bfs() {

         memset(vis,,sizeof(vis));

         q.push(s); d[s]=; vis[s]=;

         while(!q.empty()) {

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

             FOR(i,,(int)g[u].size()-) {

                 Edge& e=es[g[u][i]];

                 int v=e.v;

                 if(!vis[v]&&e.cap>e.flow) {

                     vis[v]=;

                     d[v]=d[u]+;

                     q.push(v);

                 }

             }

         }

         return vis[t];

     }

     int dfs(int u,int a) {

         if(u==t||!a) return a;

         int flow=,f;

         for(int& i=cur[u];i<g[u].size();i++) {

             Edge& e=es[g[u][i]];

             int v=e.v;

             if(d[v]==d[u]+&&(f=dfs(v,min(a,e.cap-e.flow)))>) {

                 e.flow+=f;

                 es[g[u][i]^].flow-=f;

                 flow+=f; a-=f;

                 if(!a) break;

             }

         }

         return flow;

     }

     int MaxFlow(int s,int t) {

         this->s=s,this->t=t;

         int flow=;

         while(bfs()) {

             memset(cur,,sizeof(cur));

             flow+=dfs(s,inf);

         }

         return flow;

     }

 } dc;

 int T,n,m,ans[N][N],b[N],t[N],vis[N],tot;

 void dfs(int u)

 {

     vis[u]=;

     FOR(i,,(int)dc.g[u].size()-) {

         Edge& e=dc.es[dc.g[u][i]];

         if(!vis[e.v]&&e.cap>e.flow) dfs(e.v);

     }

 }

 void solve(int l,int r)

 {

     if(l==r) return ;

     dc.clear();

     int S=b[l],T=b[r],cut;

     cut=dc.MaxFlow(S,T);

     memset(vis,,sizeof(vis));

     dfs(S);

     FOR(i,,n) if(vis[i])

         FOR(j,,n) if(!vis[j])

             ans[i][j]=ans[j][i]=min(ans[i][j],cut);

     int L=l,R=r;

     FOR(i,l,r)

         if(vis[b[i]]) t[L++]=b[i];

         else t[R--]=b[i];

     FOR(i,l,r) b[i]=t[i];

     solve(l,L-),solve(L,r);

 }

 int main()

 {

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

     //freopen("out.out","w",stdout);

     T=read();

     while(T--) {

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

         dc.init(n+);

         FOR(i,,m) {

             int u=read(),v=read(),w=read();

             dc.AddEdge(u,v,w),dc.AddEdge(v,u,w);

         }

         FOR(i,,n) {

             b[i]=i;

             FOR(j,,n) ans[i][j]=inf;

         }

         solve(,n);

         int q=read();

         while(q--) {

             int x=read(),res=;

             FOR(i,,n) FOR(j,i+,n)

                 if(ans[i][j]<=x) res++;

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

         }

         puts("");

     }

     return ;

 }