#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

#define DEBUG_VAR(x) { cerr << "* "#x" = " << x << endl; }
#define DEBUG_ARR(arr, l, r) { \ 
    cerr << "* "#arr"[" << l << ", " << r << "]:"; \
    for(auto it = l, itr = r; it <= itr; it++) \
        cerr << arr[it] << ", "; \
    cerr << endl; \
}
#define DEBUG_FMT(...) { cerr << "* "; fprintf(stderr, __VA_ARGS__); }
#define DEBUG_HERE { DEBUG_FMT("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__); } 

using namespace std;
using LL = long long;
using ULL = unsigned long long;

const int N = 1e6 + 5;
const int INF = 0x3f3f3f3f;

int n;
int a[N];
vector<int> e[N];

int f[N], g[N];
int ans = INF;

void dp(int x, int fa)
{
    f[x] = 1 + a[x];
    g[x] = 1 - a[x];
    ans = min(ans, 1 + a[x] - a[x]);
    
    for(int y : e[x]) {
        if(y == fa) continue;
        dp(y, x);

        ans = min(ans, f[y] + g[x]);
        ans = min(ans, f[x] + g[y]);

        f[x] = min(f[x], f[y] + 1);
        g[x] = min(g[x], g[y] + 1); 
    }
}

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

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

    memset(f, 0x3f, sizeof(*f)*(n + 1));
    memset(g, 0x3f, sizeof(*g)*(n + 1));
    
    ans = INF;
    dp(1, -1);

    cout << ans << endl;
}

int main()
{
    // freopen("1.in", "r", stdin);
    ios::sync_with_stdio(false); cin.tie(nullptr);

    int T; cin >> T;
    while(T--) {
        solve();
    }

    return 0;
}