#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2e6 + 5;
int n, k;
vector<int> g[N];
int c[N];
int f[N][2];
bool ban_to_fa[N];
int ans;
void dfs(int u, int fa) {
    f[u][c[u] & 1] = c[u];
    for (int v : g[u]) {
        if (v == fa) continue;
        dfs(v, u);
        if (ban_to_fa[v]) continue;
        int t0 = max(f[u][0] + f[v][0], f[u][1] + f[v][1]);
        int t1 = max(f[u][0] + f[v][1], f[u][1] + f[v][0]);
        f[u][0] = max(f[u][0], t0);
        f[u][1] = max(f[u][1], t1);
    }
    if (f[u][k & 1] >= k) {
        ban_to_fa[u] = 1;
        ++ans;
    }
}
void solve() {
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &c[i]);
    }
    for (int i = 1; i < n; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for (int i = 1; i <= n; i++) {
        f[i][0] = f[i][1] = -1e9;
    }
    dfs(1, -1);
    printf("%d\n", ans);
}
void clear() {
    ans = 0;
    for (int i = 1; i <= n; i++) {
        g[i].clear();
        ban_to_fa[i] = 0;
    }
}
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
        clear();
    }
}