# include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5; 
int n, k, c[N]; 
vector <int> g[N]; 
int dp[N][2], ans = 0;
void dfs(int x, int fa)
{
	dp[x][c[x] & 1] = c[x], dp[x][!(c[x] & 1)] = -1e9; 
	for(int v : g[x])
	{
		if(v == fa) continue;
		dfs(v, x); 
		if(dp[v][k & 1] >= k) {++ans; continue; }
		int tmp[2] = {dp[x][0], dp[x][1]}; 
		dp[x][1] = max(dp[x][0], max(dp[v][0] + tmp[1], dp[v][1] + tmp[0]));
		dp[x][0] = max(dp[x][0], max(dp[v][1] + tmp[1], dp[v][0] + tmp[0]));
	}
	return; 
}
int main(void)
{
	int Test; scanf("%d", &Test);
	while(Test--)
	{
		scanf("%d%d", &n, &k); ans = 0;
		for(int i = 1; i <= n; i++) scanf("%d", &c[i]), g[i].clear(); 
		for(int i = 1; i < n; i++)
		{
			int u, v; scanf("%d%d", &u, &v); 
			g[u].push_back(v), g[v].push_back(u); 
		}
		dfs(1, 0);
		if(dp[1][k & 1] >= k) ++ans; 
		printf("%d\n", ans);
	}
	return 0; 
}