/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;
int n,k;
int cnt[1000005],c[1000005],r1[1000005],r2[1000005];
vector <int> g[1000005];
void dfs0(int u,int fa)
{
	int mx1=-inf,mx2=0;
	for(int i=0;i<g[u].size();i++)
	{
		int v=g[u][i];
		if(v==fa) continue;
		dfs0(v,u),cnt[u]+=cnt[v];
		int mxx1=mx1,mxx2=mx2;
		mxx1=max(mxx1,max(mx2+r1[v],mx1+r2[v]));
		mxx2=max(mxx2,max(mx2+r2[v],mx1+r1[v]));
		mx1=mxx1,mx2=mxx2;
	}
	if(c[u]==0||c[u]==2) mx1+=c[u],mx2+=c[u];
	else swap(mx1,mx2),mx1+=c[u],mx2+=c[u];
	r1[u]=mx1,r2[u]=mx2;
	r2[u]=max(r2[u],0LL);
	if(k%2==1&&r1[u]>=k) r1[u]=-inf,r2[u]=0,cnt[u]++;
	if(k%2==0&&r2[u]>=k) r1[u]=-inf,r2[u]=0,cnt[u]++;
}
void solve()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++) cin>>c[i];
	for(int i=1;i<=n;i++) cnt[i]=r1[i]=r2[i]=0,g[i].clear();
	for(int i=1;i<n;i++)
	{
		int u,v;
		cin>>u>>v;
		g[u].pb(v),g[v].pb(u);
	}
	dfs0(1,-1);
	cout<<cnt[1]<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
	cin>>_;
	while(_--) solve();
	return 0;
}