#include<bits/stdc++.h>
#define FILE "read"
#define MAXN 350
#define INF 1000000000
using namespace std;
struct node{int y,next,v;}e[6010];
int n,m,len,S,T,Link[MAXN],a[MAXN],vis[MAXN],level[MAXN],temp[MAXN],val[MAXN][MAXN];
queue<int>q;
char buf[1<<15],*fs,*ft;
inline char getc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
inline int read(){
	int x=0,f=1;  char ch=getc();
	while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getc();}
	while(isdigit(ch))  {x=x*10+ch-'0';  ch=getc();}
	return x*f;
}
void insert(int x,int y,int v){e[++len].next=Link[x];Link[x]=len;e[len].y=y;e[len].v=v;}
void dfs(int x){
	vis[x]=1;
	for(int i=Link[x];i;i=e[i].next)
		if(e[i].v&&!vis[e[i].y])  dfs(e[i].y);
}
bool bfs(){
	memset(level,-1,sizeof(level));
	q.push(S);  level[S]=0;
	while(!q.empty()){
		int x=q.front(); q.pop();
		for(int i=Link[x];i;i=e[i].next)
			if(level[e[i].y]==-1&&e[i].v){
				q.push(e[i].y);
				level[e[i].y]=level[x]+1;
			}
	}
	return level[T]>=0;
}
int MAXFLOW(int x,int flow){
	if(x==T)  return flow;
	int d=0,maxflow=0;
	for(int i=Link[x];i&&maxflow<flow;i=e[i].next)
		if(level[e[i].y]==level[x]+1&&e[i].v)
			if(d=MAXFLOW(e[i].y,min(e[i].v,flow-maxflow)))
				e[i].v-=d,e[i^1].v+=d,maxflow+=d;
	if(!maxflow)  level[x]=-1;
	return maxflow;
}
void solve(int l,int r){
	if(l==r)  return;
	S=a[l]; T=a[r];  int d=0,ans=0;
	for(int i=1;i<=len;++i)  e[i].v=e[i^1].v=(e[i].v+e[i^1].v)>>1;
	while(bfs()) while(d=MAXFLOW(S,INF)) ans+=d;
	memset(vis,0,sizeof(vis));  dfs(S);
	for(int i=1;i<=n;++i)if(vis[i]){
		for(int j=1;j<=n;++j)if(!vis[j])
			val[i][j]=val[j][i]=min(val[i][j],ans);
	}
	int ta=l,tb=r;
	for(int i=l;i<=r;++i){
		if(vis[a[i]]) temp[ta++]=a[i];
		else temp[tb--]=a[i];
	}
	for(int i=l;i<=r;++i) a[i]=temp[i];
	solve(l,ta-1);  solve(tb+1,r); 
}
void pre(){
	len=1;  
	memset(Link,0,sizeof(Link));
	memset(val,10,sizeof(val));
}
void solve(){
	n=read();  m=read();  pre();
	for(int i=1;i<=n;++i)  a[i]=i;
	for(int i=1;i<=m;++i){
		int x=read(),y=read(),v=read();
		insert(x,y,v); insert(y,x,v);
	}
	solve(1,n);
	for(int T=read();T;--T){
		int x=read(),ans=0;
		for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j)
			if(val[i][j]<=x)  ans++;
		printf("%d\n",ans);
	}
	printf("\n");
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	for(int T=read();T;--T) solve();
	return 0;
}