#include<iostream>
#include<cstdio>
#include<vector>
#define N 1000000
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int T,n,k,cnt,c[N+1],l[N+1][2],r[N+1][2],sl[2],sr[2];
vector<int>E[N+1];
bool used[N+1];
void add(int x,int y)
{
	E[x].push_back(y),E[y].push_back(x);
	return;
}
void dfs(int x)
{
	used[x]=1,l[x][c[x]&1]=r[x][c[x]&1]=c[x],l[x][!(c[x]&1)]=inf,r[x][!(c[x]&1)]=-inf;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
		{
			dfs(E[x][i]);
			for (int op=0;op<=1;++op) sl[op]=l[x][op],sr[op]=r[x][op];
			for (int op=0;op<=1;++op)
				for (int op2=0;op2<=1;++op2)
					sl[op^op2]=min(sl[op^op2],l[x][op]+l[E[x][i]][op2]),sr[op^op2]=max(sr[op^op2],r[x][op]+r[E[x][i]][op2]);
			for (int op=0;op<=1;++op) l[x][op]=sl[op],r[x][op]=sr[op];
		}
	if (l[x][k&1]<=k&&k<=r[x][k&1]) cnt++,l[x][0]=r[x][0]=0,l[x][1]=inf,r[x][1]=-inf;
	return;
}
int main()
{
	int x,y;
	T=read();
	while (T--)
	{
		n=read(),k=read(),cnt=0;
		for (int i=1;i<=n;++i) used[i]=0,E[i].clear();
		for (int i=1;i<=n;++i) c[i]=read();
		for (int i=1;i<=n-1;++i) x=read(),y=read(),add(x,y);
		dfs(1),printf("%d\n",cnt);
	}
	return 0;
}