#include<bits/stdc++.h>
using std::cin, std::cout;
using ll = long long;
int T;
int n;
const int N = 200005;
struct edge {
	int to, nxt;
} e[N << 1];
int h[N], num;
void link(int x, int y) {
	e[++num] = {y, h[x]}, h[x] = num;
	e[++num] = {x, h[y]}, h[y] = num;
}
ll a[N];
ll ans;
int size[N];
int vis[N];
int root, mn;
void clear() {
	num = 0;
	for(int i = 1;i <= n;++i) {
		h[i] = vis[i] = 0;
	}
	ans = 0;
}
void dfs0(int x, int fa = 0) {
	size[x] = 1;
	for(int i = h[x];i;i = e[i].nxt) if(e[i].to != fa && !vis[e[i].to]) {
		dfs0(e[i].to, x);
		size[x] += size[e[i].to];
	}
}
void dfs1(int x, int s, int fa = 0) {
	int max = s - size[x];
	for(int i = h[x];i;i = e[i].nxt) if(e[i].to != fa && !vis[e[i].to]) {
		dfs1(e[i].to, s, x);
		max = std::max(max, size[e[i].to]);
	}
	if(max < mn) mn = max, root = x;
}
int getroot(int x) {
	mn = 1e9;
	dfs0(x), dfs1(x, size[x]);
	return root;
}
using pr = std::pair<ll, ll>;

std::vector<pr> v, all;
void dfs2(int x, ll sum, ll max, int fa = 0) {
	sum += a[x] * 2;
	max = std::max(max, a[x] * 2);
	v.emplace_back(sum, max);
	for(int i = h[x];i;i = e[i].nxt) if(e[i].to != fa && !vis[e[i].to]) {
		dfs2(e[i].to, sum, max, x);
	}
}
ll calc(std::vector<pr> o) {
	std::vector<ll> vo;
	for(auto [x, y] : o) vo.push_back(x);
	sort(vo.begin(), vo.end());
	std::vector<int> bit(vo.size() + 1);
	auto inc = [&](ll w) {
		w = lower_bound(vo.begin(), vo.end(), w) - vo.begin() + 1;
		for(;w;w &= w - 1) {
			bit[w] += 1;
		}
	};
	auto qry = [&](ll w) {
		ll ans = 0;
		w = upper_bound(vo.begin(), vo.end(), w) - vo.begin() + 1;
		for(;w < (int) bit.size();w += w & -w) {
			ans += bit[w];
		}
		return ans;
	};
	sort(o.begin(), o.end(), [](pr x, pr y) { return x.second < y.second; });
	ll res = 0;
	for(auto [x, y] : o) {
		res += qry(y + y - x);
		inc(x);
	}
	return res;
}
void solve(int x) {
	x = getroot(x);
	vis[x] = 1;
	all = {}, all.emplace_back(a[x], 2 * a[x]);
	for(int i = h[x];i;i = e[i].nxt) if(!vis[e[i].to]) {
		v = {};
		dfs2(e[i].to, a[x], 2 * a[x], x);
		all.insert(all.end(), v.begin(), v.end());
		ans -= calc(v);
	}
	ans += calc(all);
	for(int i = h[x];i;i = e[i].nxt) if(!vis[e[i].to]) {
		solve(e[i].to);
	}
}

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> T;
	for(int i = 0;i < T;++i) {
		cin >> n;
		for(int i = 1;i <= n;++i) {
			cin >> a[i];
		}
		for(int i = 1, x, y;i < n;++i) {
			cin >> x >> y;
			link(x, y);
		}
		solve(1);
		cout << ans << '\n';
		clear();
	}
}