#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<unordered_map>
#include<time.h>
#include<cstdlib>
typedef long long ll;
typedef unsigned long long ull;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
//#pragma comment(linker, "/STACK:36777216")  //hdu 扩栈
#define mm(a) memset(a,0,sizeof(a))
#define lr rt<<1
#define rr rt<<1|1
#define sync std::ios::sync_with_stdio(false);std::cin.tie(0);
#define inf 0x3f3f3f3f
//#define eqs 1e-8
#define lb(x) (x&(-x))
#define ch(a) (int(a-'a')+1)
#define rep(i, a, b) for(int i=a;i<=b;i++)
#define mkp(a, b) make_pair(a,b)
using namespace std;
typedef pair<int,int> pii;
//const double pi=acos(-1);
const int maxn=500010;  // 要开大！！！
const ll Mod=1000000007;
//const ll Mod = 998244353;

ll a[maxn];
ll w[maxn];
int d[maxn];

int main()
{
    sync;
    int t;
    int n;
    cin>>t;
    while(t--)
    {
        cin>>n;
        ll sum=0ll;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            sum+=1ll*a[i];
            w[i]=0;
            d[i]=0;
        }
        int cnt=0;
        int u,v;
        for(int i=1;i<n;i++)
        {
            cin>>u>>v;
            d[u]++;
            d[v]++;
        }
        int j;
        for(int i=1;i<=n;i++)
        {
            for(j=1;j<d[i];j++)
            {
                w[++cnt]=a[i];
            }
        }
        sort(w+1,w+n+1);
        cout<<sum<<' ';
        for(int i=1;i<=n-2;i++)
        {
            sum+=1ll*w[n-i+1];
            cout<<sum<<' ';
        }
        cout<<endl;
            
    }
    
    return 0;
}
