#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
vector<int> g[N];
int dp[N][2];
int n, k, ans;
void dfs(int x, int fa) {
    for (auto v : g[x]) {
        if (v == fa) continue;
        dfs(v, x);
        vector<int> g(2);
        g[0] = dp[x][0], g[1] = dp[x][1];
        if (dp[x][0] != -1 && dp[v][0] != -1) g[0] = max(g[0], dp[x][0] + dp[v][0]);
        if (dp[x][1] != -1 && dp[v][1] != -1) g[0] = max(g[0], dp[x][1] + dp[v][1]);
        if (dp[x][1] != -1 && dp[v][0] != -1) g[1] = max(g[1], dp[x][1] + dp[v][0]);
        if (dp[x][0] != -1 && dp[v][1] != -1) g[1] = max(g[1], dp[x][0] + dp[v][1]);
        dp[x][0] = g[0];
        dp[x][1] = g[1];
    }
    if (dp[x][k & 1] >= k) {
        ans++;
        dp[x][0] = dp[x][1] = -1;
    }
}
void solve() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        g[i].clear();
        dp[i][0] = dp[i][1] = -1;
    }
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        if (!x)
            dp[i][0] = dp[i][1] = 0;
        else
            dp[i][x & 1] = x;
    }
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    ans = 0;
    dfs(1, 0);
    cout << ans << '\n';
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}