#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = l; i <= r; ++ i)
#define int long long
using namespace std;
const int MAXN = 1e5 + 10;

int read()
{
	char cc(getchar()); int cn(0), flus(1);
	while(!isdigit(cc)) {if(cc == '-') flus = -flus; cc = getchar();}
	while(isdigit(cc)) cn = cn * 10 + cc - 48, cc = getchar();
	return cn * flus;
}

struct edge
{
	int to, next;
} e[MAXN << 1];

int n, tot;
int mdep, mp;
int head[MAXN], a[MAXN];

void add(int u, int v)
{
	e[++tot].next = head[u];
	head[u] = tot;
	e[tot].to = v;
}

void init()
{
	tot = 0;
	rep(i, 1, n + 1) head[i] = 0;
}

void dfs(int u, int fa, int dep)
{
	if(dep > mdep)
	{
		mdep = dep;
		mp = u;
	}
	for(int i = head[u]; i; i = e[i].next)
	{
		int v = e[i].to;
		if(v == fa) continue;
		dfs(v, u, dep + 1);
	}
}

signed main()
{
	int T = read();
	while(T --)
	{
		n = read();
		init();
		rep(i, 1, n) a[i] = read();
		rep(i, 1, n)
		{
			int u = read(), v = read();
			add(u, v);
			add(v, u);
		}
		mdep = mp = 0;
		dfs(1, 0, 0);
		int st = mp;
		mdep = mp = 0;
		dfs(st, 0, 0);
		sort(a + 1, a + 1 + n);
		int ans(0);
		for(int i = n; i >= n - mdep + 1; -- i)
		{
			ans += a[i];
		}
		printf("%lld\n", ans);
	}
	return 0;
}


/*
  
2
5
1 7 3 5 4
1 3
2 3
3 4
4 5
4 6
1
1000000000
1 2
  
  
  
  
 */