#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

const int DIM = 1e6 + 5;

int n, k;
int c[DIM];
int dp[DIM][2];
vector<int> v[DIM];

const int INF = 1e9;

int dfs(int nod = 1, int papa = 0) {
  int nr = 0;
  dp[nod][c[nod] % 2] = c[nod];
  dp[nod][1 - c[nod] % 2] = -INF;
  for (auto it : v[nod]) {
    if (it == papa)
      continue;

    nr += dfs(it, nod);
    int aux = max({dp[nod][0], dp[nod][0] + dp[it][0], dp[nod][1] + dp[it][1]});
    dp[nod][1] = max({dp[nod][1], dp[nod][1] + dp[it][0], dp[nod][0] + dp[it][1]});
    dp[nod][0] = aux;
  }

  if (dp[nod][k % 2] >= k) {
    ++nr;
    dp[nod][0] = dp[nod][1] = -INF;
  }

  return nr;
}

void solve() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> c[i];
  }

  for (int i = 1; i < n; ++i) {
    int x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }

  cout << dfs() << '\n';
  for (int i = 1; i <= n; ++i) {
    dp[i][0] = dp[i][1] = 0;
    v[i].clear();
  }
}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
  cin >> t;
  while (t--)
    solve();

  return 0;
}