#include<bits/stdc++.h>
using namespace std;

const int inf = 0x3f3f3f3f;

#define PII pair<int,int>
#define endl "\n"
#define ll long long

const int N = 1e6 + 5, M = 5000;
const int mod = 998244353;

vector<int>g[N];
int c[N], f[N][2];
int n,k,ans;

void dfs(int u,int fa){
	int sum0 = 0, sum1 = 0;
	for(auto &v:g[u]){
		if(v == fa)continue;
		dfs(v, u);
		
		if((k & 1) && f[v][1] >= k || (k % 2 == 0) && f[v][0] >= k){
			ans += 1;
			continue;
		}
		
		//更新最大奇偶个数 
		if(f[v][1])sum1 = max(sum1, sum0 + f[v][1]);
		if(sum1)sum1 = max(sum1, f[v][0] + sum1);
		sum0 = max(sum0, sum0 + f[v][0]);
		if(sum1 && f[v][1])sum0 = max(sum0, sum1 + f[v][1]);
	}
	
	if(c[u] & 1){
		f[u][1] = sum0 + c[u];
		if(sum1)f[u][0] = sum1 + c[u];
	}
	else{
		f[u][0] = sum0 + c[u];
		if(sum1)f[u][1] = sum1 + c[u];
	}
} 

void solve(){
	cin>>n>>k;
	for(int i=1;i<=n;i++)cin>>c[i];
	for(int i=1,u,v;i<n;i++){
		cin>>u>>v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	ans = 0;
	dfs(1, 0);
	//不要忘了特判根节点 
	if((k & 1) && f[1][1] >= k || (k % 2 == 0) && f[1][0] >= k)ans += 1;
	cout<<ans<<endl;
	
	for(int i=1;i<=n;i++){
		vector<int>().swap(g[i]);
		f[i][0] = f[i][1] = 0;
	}
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t = 1;
	cin>>t;
	for(int i=1;i<=t;i++){
		solve();
	}
	return 0;
}