#include<bits/stdc++.h>
#define N 1000005
//#define gc() (iS==iT?(iT=(iS=ibuf)+fread(ibuf,1,SIZE,stdin),(iS==iT?EOF:*iS++)):*iS++)
#define gc() getchar()
#define fi first
#define se second
#define Kamisato return
#define Ayaka 0;
#define file(_s) freopen(#_s".in","r",stdin);freopen(#_s".out","w",stdout);
//#define CHECK_MEMORY ___JQH___
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf=1e9;
const ll INF=2e18;
bool Memory_Begin;
namespace IO{const int SIZE=(1<<21)+1;char ibuf[SIZE],*iS,*iT,obuf[SIZE],*oS=obuf,*oT=oS+SIZE-1,c,qu[55];int f,qr;inline void flush(){fwrite(obuf,1,oS-obuf,stdout),oS=obuf,fflush(stdout);}inline void putc(char x){*oS++=x;if(oS==oT)flush();}template <class I>inline void read(I &x){for(f=1,c=gc();c<'0'||c>'9';c=gc())if(c=='-')f=-1;for(x=0;c<='9'&&c>='0';c=gc())x=x*10+(c&15);x*=f;}template <class I>inline void print(I x){if(!x)putc('0');if(x<0)putc('-'),x=-x;while(x)qu[++qr]=x%10+'0',x/=10;while(qr)putc(qu[qr --]);}inline void reads(string &s){s.clear();for(c=gc();c<33||c>126;)c=gc();for(;c>=33&&c<=126;c=gc())s.push_back(c);}inline void prints(string s){for(char c:s)putc(c);}struct Flusher_ {~Flusher_(){flush();}}io_flusher_;}
using IO::read;using IO::putc;using IO::print;using IO::reads;using IO::prints;
template<class I>I updiv(I x,I y){return (x%y==0?x/y:x/y+1);}
template<class I>bool cmin(I &x,I y){if(x>y)return x=y,1;return 0;}
template<class I>bool cmax(I &x,I y){if(x<y)return x=y,1;return 0;}

int n,m,ans,c[N];
vector<int>s[N];
int f[N][2];
bool cut[N];
void dfs(int x,int prt)
{
	f[x][c[x]&1]=c[x];
	for(int y:s[x])
	{
		if(y==prt) continue;
		dfs(y,x);
		if(cut[y]) continue;
		int tmp[2]={f[x][0],f[x][1]};
		for(int i=0;i<2;i++)
			for(int j=0;j<2;j++)
				if(tmp[i]!=-inf&&f[y][j]!=-inf) cmax(f[x][(i+j)&1],tmp[i]+f[y][j]);
	}
	if(f[x][m&1]>=m) ans++,cut[x]=1;
}
void solve()
{
	read(n),read(m),ans=0;
	for(int i=1;i<=n;i++) read(c[i]),f[i][0]=f[i][1]=-inf;
	for(int i=1,x,y;i<n;i++)
	{
		read(x),read(y);
		s[x].push_back(y);
		s[y].push_back(x);
	}
	dfs(1,0);
	print(ans),putc('\n');
}
void clear()
{
	for(int i=1;i<=n;i++) s[i].clear(),cut[i]=0;
}
bool Memory_End;
signed main()
{
#ifdef CHECK_MEMORY
	cerr<<"Memory: "<<(&Memory_End-&Memory_Begin)/1048576.0<<" MiB\n";
#endif
	int T; read(T);
	while(T--) solve(),clear();
	Kamisato Ayaka
}