#include <bits/stdc++.h>
using namespace std;
using P=array<int,2>;
const int inf=1e9;
void solve(){
	int n,k,ans=0;
	cin>>n>>k;
	vector<int> c(n);
	vector<P> f(n);
	vector<vector<int>> e(n);
	for(int&x:c) cin>>x;
	for(int i=1,u,v;i<n;i++) cin>>u>>v,e[--u].push_back(--v),e[v].push_back(u);
	auto merge=[&](P x,P y){
		return P{max(x[0]+y[0],x[1]+y[1]),max(x[0]+y[1],x[1]+y[0])};
	};
	auto dfs=[&](auto self,int x,int fa)->void{
		f[x]={c[x]==1?-inf:c[x],c[x]==1?1:-inf};
		for(int y:e[x]) if(y!=fa) self(self,y,x),f[x]=merge(f[x],f[y]);
		if((k%2&&f[x][1]>=k)||(k%2==0&&f[x][0]>=k)) ans++,f[x]={0,-inf};
		f[x][0]=max(f[x][0],0);
	};
	dfs(dfs,0,-1);
	cout<<ans<<"\n";
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin>>t;
	while(t--) solve();
	return 0;
}