#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1000000000;
int n,k,ans = 0;
vector<int>p[1000005];
int mx[1000005][2],a[1000005];
void dfs(int now,int fa){
	mx[now][a[now]&1] = a[now];
	mx[now][(a[now]&1)^1] = -inf;
//	cout << " " << mx[now][0] << " " << mx[now][1] << endl;
	for(auto x:p[now]){
		if(x == fa)continue;
		dfs(x,now);
		int f0 = -inf,f1 = -inf;
		f0 = max(mx[now][0]+mx[x][0],mx[now][1]+mx[x][1]);
		f1 = max(mx[now][0]+mx[x][1],mx[now][1]+mx[x][0]);
		mx[now][0] = f0,mx[now][1] = f1;
	}
//	cout << now << " " << mx[now][0] << " " << mx[now][1] << endl;
	if(mx[now][k&1]>=k){
		++ans;
		mx[now][0] = 0;
		mx[now][1] = -inf;
	}
	
}
void solve(){
	ans = 0;
	for(int i =1;i<=n;i++)p[i].clear();
	cin >> n >> k;
	for(int i = 1;i<=n;i++)cin >> a[i];
	for(int i = 1;i<n;i++){
		int a,b;cin >>a >> b;
		p[a].push_back(b),p[b].push_back(a);
	}
	dfs(1,1);
	cout << ans << '\n';
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t;cin >> t;
	while(t--)solve();
	return 0;
}/*
1
7 5
1 2 1 2 2 1 2
1 2
2 3
3 4
3 5
5 6
5 7
*/