D.cpp

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define inf (1LL << 61)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; ++i)
#define for0(i, stop) for(ll i = 0; i < stop; ++i)
#define rep1(i, start) for(ll i = start; i >= 1; --i)
#define rep0(i, start) for(ll i = (start-1); i >= 0; --i)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define EL '\n'
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

const ll sz = 1e5 + 10;
ll deg[sz], ans[sz];

struct info {
    ll v, id;

    const bool operator <(const info &b) {
        return v < b.v;
    }
} ara[sz];

int main()
{
    ll t; sl(t);

    while(t--) {
        ll n; sl(n);

        for1(i, n) {
            sl(ara[i].v);
            ara[i].id = i;
        }

        ll sum = 0;

        for1(i, n-1) {
            ll u, v;
            sl(u), sl(v);

            deg[u]++, deg[v]++;

            sum += ara[u].v, sum += ara[v].v;
        }
        ans[n-1] = sum;

        ll idx = n-2;
        sort(ara+1, ara+n+1);

        for1(i, n) {
            for1(j, deg[ara[i].id] - 1) {
                sum -= ara[i].v;
                ans[idx--] = sum;
            }
        }

        for(; idx >= 1; idx--) ans[idx] = sum;

        for1(i, n-1) pf("%lld ", ans[i]);
        pn;

        for1(i, n)
            deg[i] = 0;
    }

    return 0;
}