#include<bits/stdc++.h>
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#else
#define D(...) ((void)0)
#endif
#define pb push_back
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
using LL=long long;
const int N=200005,INF=0X3F3F3F3F;
int T,n,a[N];
int root,full,f[N],sz[N];
vector<int>e[N];
bool ban[N];
void get_root(int k1,int k2){
	sz[k1]=1,f[k1]=0;
	for(auto&x:e[k1])if(x!=k2&&!ban[x])get_root(x,k1),sz[k1]+=sz[x],f[k1]=max(f[k1],sz[x]);
	f[k1]=max(f[k1],full-sz[k1]);
	if(f[k1]<f[root])root=k1;
}
LL sum[N];
int mx[N];
vector<int>V,allV;
vector<vector<int> >VV;
void dfs1(int k1,int k2){
	V.pb(k1);
	allV.pb(k1);
	sum[k1]=sum[k2]+a[k1];
	mx[k1]=max(mx[k2],a[k1]);
	for(auto&x:e[k1])if(x!=k2&&!ban[x]){
		dfs1(x,k1);
	}
}

struct fenwick{
	int n;
	int tr[N];
	void init(int n0){
		n=n0;
		rep(i,1,n)tr[i]=0;
	}
	void add(int x,int y){
		++x;
		for(int i=x;i;i&=i-1)tr[i]+=y;
	}
	LL query(int x){
		++x;
		LL y=0;
		for(int i=x;i<=n;i+=i&-i)y+=tr[i];
		return y;
	}
}fwk;
LL ans;
void solve(int cur){
	// D("solve %d\n",cur);
	ban[cur]=1;
	sum[cur]=0;
	mx[cur]=a[cur];
	
	VV.clear();
	allV.clear();
	for(auto&x:e[cur])if(!ban[x]){
		V.clear();
		dfs1(x,cur);
		VV.pb(V);
	}
	
	auto calc=[&](vector<int>&v){
		sort(v.begin(),v.end(),[&](int lhs,int rhs){return mx[lhs]<mx[rhs];});
		vector<LL>num;
		rep(i,0,SZ(v)-1){
			num.push_back(sum[v[i]]);
		}
		sort(num.begin(),num.end());
		num.erase(unique(num.begin(),num.end()),num.end());
		fwk.init(SZ(num));
		LL ret=0;
		rep(i,0,SZ(v)-1){
			ret+=fwk.query(upper_bound(num.begin(),num.end(),mx[v[i]]*2-sum[v[i]]-a[cur])-num.begin());
			fwk.add(lower_bound(num.begin(),num.end(),sum[v[i]])-num.begin(),1);
		}
		return ret;
	};
	ans+=calc(allV);
	for(auto&x:VV){
		ans-=calc(x);
	}
	
	int old=full;
	for(auto&x:e[cur])if(!ban[x]){
		full=sz[x]<sz[cur]?sz[x]:old-sz[cur];
		root=0;
		get_root(x,cur);
		solve(root);
	}
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>T;
	rep(tc,1,T){
		cin>>n;
		rep(i,1,n)cin>>a[i],e[i].clear();
		rep(i,2,n){
			int u,v;
			cin>>u>>v;
			e[u].pb(v),e[v].pb(u);
		}
		fill(ban+1,ban+n+1,0);
		full=n;
		root=0;
		f[0]=INF;
		get_root(1,0);
		ans=0;
		solve(root);
		printf("%lld\n",ans);
	}
	return 0;
}