#include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 
// using namespace __gnu_pbds;

// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define all(v) (v).begin(), (v).end()
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define F first 
#define S second

const ll M = 1e18 + 7;
const int N = 2e5 + 7;
const int MOD = 1e9 + 7;

int root = 0;
vector<int> adj[N];
int depth[N];

void root_find(int node,int par, vector<int> check, vector<int> adj[]){

    for (auto it : adj[node]){
        if(it == par) continue;
        root_find(it, node, check, adj);
        if (!root && check[it]) root = it;
    }
}

int dfs(int node, int cost, int par, vector<int> check, vector<int> adj[]) {

    int tmp = 0;
    for(auto it: adj[node]) {
        if(it == par) continue;

        depth[it] = depth[node] + 1;
        tmp += dfs(it,2,node,check,adj);
    }

    if(tmp == 0 && !check[node]) return 0;

    return tmp + cost;
}

void Hrid_solve(){
    int n;
    cin >> n;

    vector<int> check(n);
    for(int i = 0; i < n; i++) {
        cin >> check[i];
        if(check[i]) root = i;
    } 

    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);
    }

    if(count(all(check),1)==0) {
        cout << 0 << endl;
        return;
    }

    root_find(0,-1,check,adj);
    // cout << root << endl;
    int mx = N;

    int ans = dfs(root,0,-1,check,adj);
    for(int i = 0; i < n; i++) {
        if(check[i]) {
            mx = max(mx, depth[i]);
        }

        adj[i].clear();
        depth[i] = 0;
    }

    cout << ans-mx << endl;
    root = 0;
}


/* ************** What defines us is how well we rise after we Fall !! ************** */

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
 
    int tc = 1;
    cin >> tc;
    for(int kase = 1; kase <= tc; kase++){
        // cout << "Case " << kase << ": ";
        Hrid_solve();
    }

    return 0;
}