#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<cmath>
#include<bitset>
#include<cmath>

#define int long long 
#define x first
#define y second
#define ps push_back
#define endl '\n'

#define kd ios::sync_with_stdio(false);cin.tie();cout.tie(0);
using namespace std;
typedef pair<int,int>pi;
const int N=2e5+100,mod=1e9+7,INF=1e10;
int lowbit(int x){return x&-x;}
int gcd(int a,int b){return a%b==0?b:gcd(b,a%b);}

int w[N];
pi e[N];
int n,col[N];


int wk(int x)
{
	for(int i=1;i<=n;i++)col[i]=-1;
	col[x]=1;
	int ans=w[x];
	for(int i=4;i<=n;i++)
	{
		int u=e[i].x,v=e[i].y;
		if(col[u]==-1&&col[v]==-1)
		{
			ans+=w[i];
			col[i]=1;
		}
	}
	return ans;
}

void solve()
{	
	cin>>n;

	for(int i=1;i<=n;i++)cin>>w[i];

	for(int i=1;i<=n-3;i++)
	{
		int u,v;cin>>u>>v;
		e[i+3]={u,v};
	}
	int res=0;
	for(int i=1;i<=3;i++)
	{
		res=max(wk(i),res);
	}
	cout<<res<<endl;
}

signed main()
{
	kd;
	int _;_=1;
	cin>>_;
	while(_--)solve();	
	return 0;
}