#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back

#define Yes cout << "Yes\n"
#define No cout << "No\n"
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ff first
#define ss second
#define fori(x,y) for(int i=x;i<=(int)(y);++i)
#define forj(x,y) for(int j=x;j<=(int)(y);++j)
#define fork(x,y) for(int k=x;k<=(int)(y);++k)

#define debug(x) cerr << #x << " = " << x << endl

#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

ll MOD = 998244353;
ll qpow(ll a,ll p) {ll res=1; while(p) {if (p&1) {res=res*a%MOD;} a=a*a%MOD; p>>=1;} return res;}

const int N = 1e6+7;
const int INF = 1e9;

int n,k;
vector<int> g[N];
int arr[N];

int ans = 0;
int dp[N][2];
void dfs(int u, int fa) {
    // dp[u][0] = arr[u] == 2 ? 2 : 0;
    // dp[u][1] = arr[u] == 1 ? 1 : -INF;

    int tmp = 0;  // 记录最大和
    multiset<int> sets;
    for (auto v: g[u]) {
        if (v == fa) continue;
        dfs(v, u);
        tmp += max(dp[v][0], dp[v][1]);
        sets.insert(max(dp[v][0], dp[v][1])-min(dp[v][0], dp[v][1]));
    }
    int tmp1 = -INF, tmp0 = 0;
    // debug(tmp);
    if (tmp) {
        if (tmp%2) {
            tmp1 = tmp;
            tmp0 = tmp-*sets.begin();
        }
        else {
            tmp1 = tmp-*sets.begin();
            tmp0 = tmp;
        }
    }
    if (arr[u]%2) {
        dp[u][0] = tmp1+arr[u];
        dp[u][1] = tmp0+arr[u];
    }
    else {
        dp[u][0] = tmp0+arr[u];
        dp[u][1] = tmp1+arr[u];
    }

    if (k%2&&dp[u][1]>=k || k%2 == 0&&dp[u][0] >= k) {
        dp[u][1] = -INF;
        dp[u][0] = 0;
        ans++;
    }
    // debug(u);
    // debug(dp[u][1]);
    // debug(dp[u][0]);
}
void solve() {
    cin >> n >> k;
    ans = 0;
    fori(1, n) {
        cin >> arr[i];
        g[i].clear();
    }
    fori(1, n-1) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1, 0);
    cout << ans << endl;
}

signed main() {
	IOS;
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}