#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 1e6+5;
const int INF = 1e9;
ll C[MAXN],siz[MAXN][2];
int n,k,ans,tot,head[MAXN];
struct E
{
    int to,pre;
}e[MAXN<<2];
void add(int u,int v)
{
    e[++tot]=E{v,head[u]};
    head[u]=tot;
}
bool cut[MAXN];
void dfs(int p,int fa)
{
    siz[p][C[p]&1]=C[p];siz[p][(C[p]&1)^1]=-INF;
    for(int i=head[p];i;i=e[i].pre)
    {
        int v=e[i].to;
        if(v!=fa)
        {
            dfs(v,p);
            if(!cut[v])
            {
                ll a=siz[p][0],b=siz[p][1];
                siz[p][0]=max(a+siz[v][0],siz[v][1]+b);
                siz[p][1]=max(a+siz[v][1],b+siz[v][0]);
                siz[p][0]=max(a,siz[p][0]);
                siz[p][1]=max(b,siz[p][1]);
            }
        }
    }
    if(siz[p][k&1]>=k)
    {
        ++ans;
        cut[p]=1;
    }
}
int main()
{
    int T;scanf("%d",&T);
    while(T--)
    {
        scanf("%d %d",&n,&k);ans=0;
        for(int i=1;i<=n;++i) head[i]=0,cut[i]=0;tot=0;
        for(int i=1;i<=n;++i) scanf("%lld",&C[i]);
        for(int i=1;i<n;++i)
        {
            int u,v;
            scanf("%d %d",&u,&v);
            add(u,v);add(v,u);
        }
        dfs(1,0);
        printf("%d\n",ans);
    }
    return 0;
}