#include <bits/stdc++.h>
#define endl "\n"
#define LL long long
using namespace std;
const int N=1e6+6;
const int INF=1e8;
vector<int>edge[N];
int n,k,ans,c[N],f[N][2];

void dfs(int u,int fa){
	f[u][0]=0;
	f[u][c[u]&1]=c[u];
	for (int v:edge[u]){
		if (v==fa) continue;
		dfs(v,u);
		int a1=max(f[u][0]+f[v][0],f[u][1]+f[v][1]);
		int a2=max(f[u][0]+f[v][1],f[u][1]+f[v][0]);
		f[u][0]=max(a1,max(f[u][0],f[v][0])); 
		f[u][1]=max(a2,max(f[u][1],f[v][1]));
	}
	if (f[u][k&1]>=k){
		f[u][1]=f[u][0]=-INF;
		ans++;
	}
}

void solve(){
	cin>>n>>k; ans=0;
	for (int i=1;i<=n;i++){
		cin>>c[i];
		edge[i].clear();
		f[i][0]=f[i][1]=-INF;
	}
	for (int i=1,u,v;i<n;i++){
		cin>>u>>v;
		edge[u].push_back(v);
		edge[v].push_back(u);
	}
	dfs(1,0);
	cout<<ans<<endl;
}


int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int T; cin>>T;
	while (T--){
		solve();
	}
	return 0;
}