#include<bits/stdc++.h>
using namespace std;
typedef pair <int,int> pi;
typedef vector <int> VI;
typedef array <int,3> tri;
const int N=1e6+5,INF=1e9;
int t,n,k,c[N],x,y,f[N][2],g[N][2],ans; 
vector <int> v[N];
inline void DFS(int now=1,int fa=0)
{
	f[now][0]=f[now][1]=g[now][0]=g[now][1]=-INF;
	for (auto to:v[now]) if (to!=fa)
	{
		DFS(to,now); int tmp[2]={f[now][0],f[now][1]};
		for (int p=0;p<2;++p)
		{
			tmp[p]=max(tmp[p],g[to][p]);
			for (int q=0;q<2;++q) tmp[p^q]=max(tmp[p^q],f[now][p]+g[to][q]);
		}
		f[now][0]=tmp[0]; f[now][1]=tmp[1];
	}
	int d=c[now]&1; g[now][d]=c[now];
	for (int i=0;i<2;++i) g[now][i]=max(g[now][i],f[now][i^d]+c[now]);
	if (g[now][k&1]>=k) ++ans,g[now][0]=g[now][1]=-INF;
}
int main()
{
	for (cin>>t;t;--t)
	{
		cin>>n>>k;
		int i; for (i=1;i<=n;++i){ cin>>c[i];v[i].clear();}
		for (i=1;i<n;++i) {cin>>x>>y;v[x].push_back(y),v[y].push_back(x);}
		ans=0; DFS(); cout<<ans<<endl;
	}
	return 0;
}