#define _GLIBCXX_FILESYSTEM
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5+2;
ll n,ans[N];
bool a[N],flag[N];
vector<int> g[N];
ll f,s,tmp;

int dfs(int u,int d = 0,int p = 0) {
    int mx = 0;
    if(a[u] == 1) {
        flag[u] = 1;
        mx = d;
    }
    set<int> st;
    for(auto x: g[u]) {
        if(x == p) continue;
        int now = dfs(x,d+1,u);
        if(now) {
            if(st.size() < 2) st.insert(now);
            else if(now > *st.begin()){
                st.erase(st.begin());
                st.insert(now);
            }
        }
        mx = max(mx,now);
        if(flag[x]) 
            ans[u] += ans[x]+2;
        flag[u] |= flag[x];
    }
    if(st.size() > 1) {
        f = *st.begin();
        st.erase(st.begin());
        s = *st.begin();
    }
    if(st.size() == 1) {
        tmp = *st.begin();
    }
    return mx;
}

void solve() {
    cin >> n;
    for(int i = 0; i < n; i++) {
        cin >> a[i+1];
        flag[i+1] = 0;
        ans[i+1] = 0;
        g[i+1].clear();
    }
    for(int i = 1; i < n; i++) {
        int u,v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    f = 0;s = 0;
    dfs(1);
    ll sum = ans[1];
    // cerr << sum << ' ';
    if(f and s) sum -= (f+s);
    else sum -= 2*tmp;
    cout << sum << '\n';
    return;
}

int32_t main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int tc = 1;
    cin >> tc;
    for(int kase = 1; kase <= tc; kase++) {
        //cout << "Case " << kase << ": ";
        solve();
    }
    return 0;
}