#include <bits/stdc++.h>

using namespace std;

const int inf = 0x3f3f3f3f;

const int N = 1e6;

int n, m;
int a[N + 5];
vector<int> e[N + 5];

int fa[N + 5];
int f[N + 5][2];
int ans;
void dfs(int u) {
  fill_n(f[u], 2, -inf), f[u][a[u] & 1] = a[u];
  for (int v : e[u])
    if (v != fa[u]) {
      fa[v] = u, dfs(v);
      int t0 = max(f[u][0] + max(f[v][0], 0), f[u][1] + f[v][1]);
      int t1 = max(f[u][0] + f[v][1], f[u][1] + max(f[v][0], 0));
      f[u][0] = t0, f[u][1] = t1;
    }
  if (f[u][m & 1] >= m) ++ans, fill_n(f[u], 2, -inf);
}

void solve() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);
  fill_n(e + 1, n, vector<int>());
  for (int i = 2; i <= n; ++i) {
    int u, v; scanf("%d%d", &u, &v), e[u].push_back(v), e[v].push_back(u);
  }
  ans = 0, dfs(1);
  printf("%d\n", ans);
}

int T;

int main() {
  for (scanf("%d", &T); T; --T) solve();
}