#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 1e6 + 10;
int c[N];
vector<int> g[N];
int dp[N][2];

void init(int n) {
    for (int i = 1; i <= n; i++) {
        g[i].clear();
    }
}

void dfs(int v, int p, int k, int& ans) {
    dp[v][0] = 0;
    dp[v][1] = 0;
    dp[v][c[v] & 1] = c[v];
    for (int to : g[v]) {
        if (to != p) {
            dfs(to, v, k, ans);
            int res[2] = {};
            for (int i = 0; i <= 1; i++) {
                for (int j = 0; j <= 1; j++) {
                    res[i ^ j] = max(res[i ^ j], dp[v][i] + dp[to][j]);
                }
            }
            dp[v][0] = res[0];
            dp[v][1] = res[1];
        }
    }
    if (dp[v][k & 1] >= k) {
        ans++;
        dp[v][0] = dp[v][1] = 0;
    }
}

int solve(int n, int k) {
    int ans = 0;
    dfs(1, 1, k, ans);
    return ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif

    int t;
    cin >> t;
    while (t--) {
        int n, k;
        cin >> n >> k;
        init(n);
        for (int i = 1; i <= n; i++) {
            cin >> c[i];
        }
        for (int i = 1; i <= n - 1; i++) {
            int u, v;
            cin >> u >> v;
            g[u].push_back(v);
            g[v].push_back(u);
        }
        cout << solve(n, k) << "\n";
    }

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}