#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5; 

int n, k, ans, a[N], fa[N]; 
int f[N][2], die[N]; 
vector<int> G[N]; 
// f[i][3] 代表子树内个数，那么

void dfs(int x, int ff) {
    f[x][a[x] & 1] = a[x]; f[x][!(a[x] & 1)] = -1e9; 
    for (int y : G[x]) if (y != ff) {
        dfs(y, x); 
        if (!die[y]) {
            int t0 = f[x][0], t1 = f[x][1]; 
            f[x][0] = max({t0, t0 + f[y][0], t1 + f[y][1]}); 
            f[x][1] = max({t1, t1 + f[y][0], t0 + f[y][1]}); 
        }
    }
    if (f[x][k & 1] >= k) die[x] = 1, ++ans; 
}

void solve(void) {
    cin >> n >> k; 
    for (int i = 1; i <= n; ++i) cin >> a[i], G[i].clear(), die[i] = 0; 
    for (int i = 1; i < n; ++i) {
        int u, v; cin >> u >> v; 
        G[u].emplace_back(v); G[v].emplace_back(u); 
    }
    ans = 0; dfs(1, 0); 
    cout << ans << "\n"; 
}

int main(void) {
    freopen("linkcut.in", "r", stdin); 
    freopen("linkcut.out", "w", stdout); 
    
    ios::sync_with_stdio(0); 
    int T; cin >> T; 
    while (T--) solve(); 
    return 0;
}