#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];
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;
}
pair<int,int> operator + (pair<int,int>a,pair<int,int>b){return {a.fi+b.fi,a.se|b.se};}
pair<int,int> dfs(int x,int f){
	pair<int,int> sum={a[x],a[x]&1};
	for (auto v:g[x]) if (v^f) sum=sum+dfs(v,x);
	if (sum.fi>=k&&(sum.fi-k+1&1||sum.se&1)) ans++,sum={0,0};
	return sum;
}
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;
}