#include<iostream>
#include<cstring>
#include<vector>
#include<tuple>
#include<cassert>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    const int INF = 1e9;
    int T;
    cin >> T;
    while(T--){
        int n, k;
        cin >> n >> k;
        vector<int> a(n + 1);
        for(int i = 1; i <= n; i++) cin >> a[i];
        vector<vector<int> > g(n + 1);
        for(int i = 0; i < n - 1; i++){
            int a, b;
            cin >> a >> b;
            g[a].push_back(b);
            g[b].push_back(a);
        }

        int ans = 0;
        vector<array<int, 2> > dp(n + 1);

        auto dfs = [&](auto &&dfs, int u, int fa) -> void {
            if (a[u] == 0){
                dp[u][0] = 0;
                dp[u][1] = -INF;
            }
            else if (a[u] == 1){
                dp[u][0] = -INF;
                dp[u][1] = 1;
            }
            else{
                dp[u][0] = 2;
                dp[u][1] = -INF;
            }
            for(auto j : g[u]){
                if (j == fa) continue;
                dfs(dfs, j, u);
                array<int, 2> tmp = dp[u];
                for(int a = 0; a < 2; a++){
                    for(int b = 0; b < 2; b++){
                        tmp[a ^ b] = max(tmp[a ^ b], dp[u][a] + dp[j][b]);
                    }
                }
                dp[u] = tmp;
            }
            if (dp[u][k % 2] >= k){
                ans += 1;
                dp[u] = {-INF, -INF};
            }
        };
        dfs(dfs, 1, -1);
        cout << ans << '\n';
    }

}