#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 1e6+10,INF = 1e9;
typedef array<int,2> pr; //(min,max)
const pr Z = {INF,-INF};

void cmp(pr& x,pr y){
	x[0] = min(x[0],y[0]);
	x[1] = max(x[1],y[1]);
}
pr operator+(pr& x,pr& y){
	return {x[0]+y[0],x[1]+y[1]};
}
int T,n,k,c[MAXN],f[MAXN],tag[MAXN];
vector<int>e[MAXN];
pr g[MAXN][2];

void merge(int u,int v){
	pr h[2] = {g[u][0],g[u][1]};
	rep(i,0,1)rep(j,0,1){
		cmp(h[i^j],g[u][i]+g[v][j]);
	}
	rep(i,0,1)g[u][i] = h[i];
}

void dfs(int u,int fa){
	f[u] = tag[u] = 0;

	g[u][(c[u]&1)^1] = Z;
	g[u][c[u]&1] = {c[u],c[u]};

	for(auto v:e[u])if(v^fa){
		dfs(v,u);
		f[u]+=f[v];
		if(!tag[v]){
			merge(u,v);
		}
	}
	//printf("%d : (%d,%d) & (%d,%d)\n",u,g[u][0][0],g[u][0][1],g[u][1][0],g[u][1][1]);
	pr ret = g[u][k&1];
	if(ret[0] <= k && ret[1] >= k){
		f[u]++,tag[u]=1;
	}
}

void solve(){
	cin>>n>>k;
	rep(i,1,n)e[i].clear(),cin>>c[i];
	rep(i,1,n-1){
		int u,v;cin>>u>>v;
		e[u].push_back(v),e[v].push_back(u);
	}
	dfs(1,0);
	cout<<f[1]<<"\n";
}

int main(){
	ios::sync_with_stdio(false);

	cin>>T;
	while(T--)solve();

    return 0;
}