#include <bits/stdc++.h> 
using namespace std;
#define int long long
#define endl '\n'
#define base 191
#define mod 1145141
#define inf 0x3f3f3f3f3f3f3f3f
const int N = 1e7 + 10;
int n;
int ans;
vector<int>edge[1000010];
int a[1000010];
int dep[N], min1[N], min2[N];
void dfs(int u, int fa) {
	min1[u] = a[u] + dep[u];
	min2[u] = -a[u] + dep[u]; 
	for (auto it : edge[u]) {
		if (it == fa) {
			continue;
		}
		dep[it] = dep[u] + 1;
		dfs(it, u);
		min1[u] = min(min1[u], min1[it]);
		min2[u] = min(min2[u], min2[it]);
	}
	ans = min(ans, min1[u] + min2[u] - 2 * dep[u] + 1);
}
void solve() {
	cin >> n;
	ans = inf;
	int ma = 1;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		edge[i].clear();
	}
	for (int i = 1; i <= n - 1; ++i) {
		int u, v;
		cin >> u >> v;
		edge[u].push_back(v);
		edge[v].push_back(u);
	}
	dfs(1, 0);
	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int T = 1;
	cin >> T;
	while (T--) {
		solve();
		
	}
}

/*2
3
1 1
1 3 2
3
1 2
1 3 2*/