#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
constexpr int M=1e6+5;
int n,k,x,y,ans,a[M],f[M][2];
vector<int>g[M];
int read(){
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x*f;
}
void dfs(int x,int fa){
	f[x][a[x]&1]=a[x];f[x][~a[x]&1]=-1<<30;
	for (auto v:g[x]){
		if (v==fa) continue; dfs(v,x);
		tie(f[x][0],f[x][1])=tuple<int,int>(max(f[x][0],max(f[x][1],f[x][0])+f[v][0]),
											max(f[x][1],max(f[x][1],f[x][0])+f[v][1]));
	}
	if (f[x][0]>=k&&f[x][0]-k+1&1||f[x][1]>=k) f[x][0]=f[x][1]=0,ans++;
}
void solve(){
	n=read();k=read();
	for (int i=1;i<=n;i++) a[i]=read(),g[i].clear();
	for (int i=1;i<n;i++){
		x=read();y=read();
		g[x].push_back(y);
		g[y].push_back(x);
	} ans=0; dfs(1,0);
	printf("%d\n",ans);
}
int main(){int T=read();
	while (T--) solve();	
	return 0;
}