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

const int inf = 1e7;
const int N = 1000005;
int n, k, ans, c[N], f[N][2]; 
vector<int> g[N]; bool ban[N];

void dfs(int u, int fa){
	if(c[u] % 2 == 0) f[u][0] = c[u], f[u][1] = -inf;
	else f[u][0] = -inf, f[u][1] = c[u];
	for(auto v: g[u]) if(v != fa){
		dfs(v, u); if(ban[v]) continue;
		int t0 = f[u][0], t1 = f[u][1];
		f[u][0] = max(t0 + f[v][0], t1 + f[v][1]);
		f[u][1] = max(t0 + f[v][1], t1 + f[v][0]);
	}
//	if(u == 5) cout << f[u][1] << "qaq" << endl;
	if(f[u][k % 2] >= k){ban[u] = true; ans ++;}
}
void work(){
	scanf("%d %d", &n, &k); ans = 0;
	for(int i = 1; i <= n; i ++) scanf("%d", &c[i]), g[i].clear(), ban[i] = false;
	for(int i = 1; i < n; i ++){
		int u, v; scanf("%d %d", &u, &v);
		g[u].pb(v); g[v].pb(u);
	}
	dfs(1, 0); printf("%d\n", ans);
}
int main(){
	int t; scanf("%d", &t);
	while(t --) work(); return 0;
}