#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> PLL;

#define x first
#define y second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define lep(i,a,b) for(int i=(a);i>=(b);i--)
#define sci(x) cin >> (x)
#define pli(x) cout << (x) << " ";
#define pll(x) cout << (x) << '\n';
#define yes cout << "Yes" << '\n';
#define no cout << "No" << '\n';
#define ls u << 1
#define rs u << 1 | 1
//cout << "? " << << ' ';
//printf("case:%d %d\n", );

const int N = 1e6 + 10;
//const ll p = 1e9 + 7;
ll n, m, k, res;

ll a[N], b[N], f[N][2], ne[N];
char s1[N], s2[N], t[N];
vector<int> e[N];

void add(ll &o, ll &j, ll v)
{
    ll to = 0, tj = 0;
    if((v + o) & 1) tj = max(tj, v + o); else to = max(to, v + o);
    if((v + j) & 1) tj = max(tj, v + j); else to = max(to, v + j);
    
    o = max(o, to), j = max(j, tj);
}

void dfs(int u, int fa)
{
    if(a[u] == 1) f[u][1] = 1, f[u][0] = 0; else if(a[u] == 2) f[u][1] = 0, f[u][0] = 2;
    for(auto j : e[u]) if(j != fa)
    {
        dfs(j, u);
        add(f[u][0], f[u][1], f[j][0]), add(f[u][0], f[u][1], f[j][1]);
    }
    
    if(k % 2 == 1 && f[u][1] >= k) res++, f[u][0] = f[u][1] = 0;
    if(k % 2 == 0 && f[u][0] >= k) res++, f[u][0] = f[u][1] = 0;
    //cout << u << ' ' << f[u][0] << ' ' << f[u][1] << '\n';
}

void solve()
{
    cin >> n >> k;
    rep(i, 1, n) sci(a[i]), f[i][0] = f[i][1] = 0, e[i].clear();
    for(int i = 1, u, v; i <= n - 1; i++) {cin >> u >> v; e[u].push_back(v), e[v].push_back(u);}
    
    res = 0; dfs(1, -1); pll(res)
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int T; T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}