#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
vector<int> g[N];
struct node {
    int one, two;
    node() {}
    node(int _one, int _two) : two(_two), one(_one) {}
    friend node operator+(const node &a, const node &b) {
        return node(a.one + b.one, a.two + b.two);
    }
} a[N];
int n, k, ans;
void dfs(int x, int fa) {
    for (auto v : g[x]) {
        if (v == fa) continue;
        dfs(v, x);
        a[x] = a[x] + a[v];
    }
    if (a[x].one + 2 * a[x].two >= k) {
        if (a[x].one + 2 * a[x].two == k || a[x].one) a[x] = {0, 0}, ans++;
    }
}
void solve() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        a[i] = {0, 0};
        g[i].clear();
    }
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        if (x == 1) a[i].one = 1;
        if (x == 2) a[i].two = 1;
    }
    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;
}