#include<bits/stdc++.h>
using namespace std;
const int N = 1000005;
int n,k,a[N],f[N][2],ans;
vector<int>e[N];
void dfs(int x,int fa){
	f[x][0] = f[x][1] = -1e9;
	f[x][a[x]&1] = a[x];
	
	for(int to:e[x]){
		if(to == fa) continue;
		dfs(to,x);
		int tmp1 = f[x][1],tmp0 = f[x][0];
		if(tmp1 != -1) f[x][1] = max(f[x][1],tmp1 + f[to][0]),f[x][0] = max(f[x][0],tmp1 + f[to][1]);
		if(tmp0 != -1) f[x][0] = max(f[x][0],tmp0 + f[to][0]),f[x][1] = max(f[x][1],tmp0 + f[to][1]);
	}
	if(f[x][k & 1] >= k){
		++ans;
		f[x][0] = f[x][1] = -1e9;
	}
}
void slove(){
	ans = 0;
	cin >> n >> k;
	for(int i = 1;i <= n;++i) e[i].clear();
	for(int i = 1;i <= n;++i) cin >> a[i];
	for(int i = 2,x,y;i <= n;++i){
		cin >> x >> y;
		e[x].push_back(y);
		e[y].push_back(x);
	}
	dfs(1,1);
	cout << ans << endl;
}
int T;
int main(){
	//freopen("linkcut.in","r",stdin);
	//freopen("linkcut.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> T;
	while(T--) slove();
	return 0;
}