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

#define dbg(x...) \
do { \
std::cout << #x << " -> "; \
err(x); \
} while (0)

void err() {
	std::cout << std::endl;
}

template<class T, class... Ts>
void err(T arg, Ts &... args) {
	std::cout << fixed << setprecision(10) << arg << ' ';
	err(args...);
}

const int maxn = 1e6 + 5;
vector<int>t[maxn];
int dp[maxn][2],c[maxn],ans;
int n,k;

void dfs(int u,int f) {
	if (c[u] == 1) dp[u][1] = 1,dp[u][0] = -1;
	else if (c[u] == 2) dp[u][1] = -1,dp[u][0] = 2;
	else if (c[u] == 0) dp[u][0] = 0,dp[u][1] = -1;
	for (auto i : t[u]) {
		if (i == f) continue;
		dfs(i,u);
		int tmp0 = dp[u][0],tmp1 = dp[u][1];
		if (tmp0 != -1 && dp[i][0] != -1) dp[u][0] = tmp0 + dp[i][0];
		if (tmp1 != -1 && dp[i][1] != -1) dp[u][0] = max(dp[u][0],dp[i][1] + tmp1);
		
		if (tmp0 != -1 && dp[i][1] != -1) dp[u][1] = max(dp[u][1],tmp0 + dp[i][1]);
		if (tmp1 != -1 && dp[i][0] != -1) dp[u][1] = max(dp[u][1],tmp1 + dp[i][0]);
	}
	if (dp[u][k&1] >= k) {
		ans++;
		dp[u][1] = dp[u][0] = -1;
	}
}

void GENSHEN_START() {
	ans = 0;
	cin >> n >> k;
	for (int i = 1;i <= n;i++) cin >> c[i];
	for (int i = 1;i <= n;i++) {
		t[i].clear();
		dp[i][0] = dp[i][1] = -1;
	}
	for (int i = 1;i < n;i++) {
		int u,v;cin >> u >> v;
		t[u].push_back(v);
		t[v].push_back(u);
	}
	dfs(1,0);
	cout << ans << '\n';
}

signed main()
{
	ios::sync_with_stdio(false);cin.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T--) GENSHEN_START();
	return 0;
}