#include <cstdio>
#include <vector>
#include <algorithm>

#define X first
#define Y second
#define PB push_back

using namespace std;

const int N = 1e6 + 500;

typedef pair < int, int > pii;
typedef pair < int, pii > st;

int n, k, c[N];
vector < int > v[N];

st dfs(int x, int lst){
	int sve2 = 0, bst_dif = -2 * N, odg = 0, bar1, maax = 0;
	for(int y : v[x]) {
		if(y == lst) continue;
		st nw = dfs(y, x);
		if(nw.Y.Y > 0)
			bst_dif = max(bst_dif, nw.Y.Y - nw.Y.X);
		sve2 += nw.Y.X;
		odg += nw.X;
		maax = max(maax, nw.Y.X);
	}
	if(c[x] == 0) {
		bar1 = sve2 + bst_dif;
	} else if(c[x] == 1) {
		bar1 = max(sve2 + bst_dif + 1, 1);
		sve2 += 1;
	} else{
		bar1 = sve2 + bst_dif + 2;
		sve2 += 2;
	}
	if((sve2 >= k && sve2 % 2 == k % 2) || (bar1 >= k) || (maax + 1 >= k && c[x] == 1)) {
		sve2 = 0; bar1 = 0; odg++;
	}
	return {odg, {sve2, max(bar1,0)}};
}


void solve(){
	scanf("%d%d", &n, &k);
	for(int i = 1;i <= n;i++) scanf("%d", c + i), v[i].clear();
	for(int i = 1;i < n;i++){
		int x, y; scanf("%d%d", &x, &y);
		v[x].PB(y), v[y].PB(x);
	}
	printf("%d\n", dfs(1, 1).X);
}

int main(){
	int T; scanf("%d", &T);
	for(;T--;) solve();
}