/*
60 + 0 + 100 + 64 = 224.
*/

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 1e6 + 9, mod = 998244353;
inline void add(int &x, int y) {x = (x + y) % mod;}
inline void del(int &x, int y) {x = (x - y + mod) % mod;}
int T, n, res[N], siz[N][2], k, c[N];
vector<int> G[N];
inline void dfs(int u, int f)
{
	siz[u][0] = siz[u][1] = -1e9;
	if(c[u] == 1) siz[u][1] = c[u];
	else siz[u][0] = c[u];
	for (auto v : G[u])
		if(v != f)
		{
			dfs(v, u); int t0, t1;
			res[u] += res[v];
			t0 = max(siz[u][1] + siz[v][1], siz[u][0] + siz[v][0]);
			t1 = max(siz[u][1] + siz[v][0], siz[u][0] + siz[v][1]);
			siz[u][0] = t0, siz[u][1] = t1;
		}
	if(siz[u][k & 1] >= k) res[u]++, siz[u][0] = 0, siz[u][1] = -1e9;
	siz[u][0] = max(siz[u][0], 0ll);
	return ;
}
inline void solve()
{
	n = read(); k = read();
	L(i, 1, n) c[i] = read(), res[i] = siz[i][0] = siz[i][1] = 0, G[i].clear();
	L(i, 1, n - 1)
	{
		int x = read(), y = read();
		G[x].pb(y), G[y].pb(x);
	}
	dfs(1, 0);
	printf("%lld\n", res[1]); return ;
}
signed main()
{
	T = read();
	L(i, 1, T) solve();
	return 0;
}