#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

constexpr i64 inf = 1E18;

void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> c(n);
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  vector<vector<int>> adj(n);
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    --u; --v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }

  vector dp(n, array<i64, 2> ({0, -inf}));
  int ans = 0;
  auto dfs = [&](auto self, int u, int fa) -> void {
    dp[u][c[u] & 1] = c[u];
    for (auto v : adj[u]) {
      if (v == fa) continue;
      self(self, v, u);
      for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
          dp[u][i ^ j] = max(dp[u][i ^ j], dp[v][i] + dp[u][j]);
        }
      }
    }
    if (dp[u][k & 1] >= k) {
      ans += 1;
      dp[u] = {0, -inf};
    }
    dp[u][0] = max(dp[u][0], 0LL);
    return ;
  };

  dfs(dfs, 0, -1);
  if (dp[0][k & 1] >= k) ++ans;
  cout << ans << "\n";
  return ;
} 

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    solve();
  } 
  return 0;
}