#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6+999;
int c[N], n, k;
vector<int> e[N];
int dp[N][2], ans;
void dfs(int u, int fa){
	if(c[u] == 1)
	   dp[u][1] = 1, dp[u][0] = 0;
	else if(c[u] == 2)
	   dp[u][1] = 0, dp[u][0] = 2;
	else dp[u][0] = dp[u][1] = 0;      
	for(auto v : e[u]){
		if(v == fa) continue;
		dfs(v, u);
		int t0, t1;
		t0 = max(dp[u][0] + dp[v][0], dp[u][1] + dp[v][1]);
		t1 = max(dp[u][1] + dp[v][0], dp[u][0] + dp[v][1]);
		dp[u][0] = t0, dp[u][1] = t1;
	}
	if(dp[u][k & 1] >= k){
		ans++;
		dp[u][0] = dp[u][1] = 0;
	}
}
void solve(){
	cin >> n >> k;
	for(int i = 1; i <= n; i++)
	    cin >> c[i];
	for(int i = 1; i < n; i++){
		int u, v;
		cin >> u >> v;
		e[u].push_back(v);
		e[v].push_back(u);
	}    
	ans = 0;
	dfs(1, 0);
	cout << ans << '\n';
	for(int i = 1; i <= n; i++)
	    e[i].clear();
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int t;
	cin >> t;
	while(t--) solve();
}