1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include <bits/stdc++.h>
 
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef pair<int,int> PI; 
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;
typedef pair<double,double> PD;
 
#define FOR(x, b, e) for(int x = b; x<= (e); x++)
#define FORD(x, b, e) for(int x = b; x>= (e); x--)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
 
#define PB push_back
#define IN insert
#define ST first
#define ND second
#define INF 2000000011
#define MOD 1000000007

#define MAXS 310
VI graf[MAXS];
LL val[MAXS];
int P[MAXS];
LL koszty[MAXS];

void makeTree(int v){
    for(auto x:graf[v]){
        if(P[x]==-1){
            P[x]=v;
            makeTree(x);
        }
    }
}

LL param;
LL tKoszt;
LL dfs(int v){
  //  cout<<v<<" i "<<val[v]<<"ech\n";
    LL sum=val[v];
    for(auto x:graf[v]){
        if(P[x]==v)
            sum+=dfs(x);
    }

    if((1<<v)&param){
        tKoszt+=sum*sum;
        sum=0;
    }
    return sum;
}

void go(){
    int n;
    cin>>n;
    REP(i,n){
        P[i]=-1;
        cin>>val[i];
        koszty[i]=LONG_LONG_MAX;
        graf[i].clear();
    }

    REP(i,n-1){
        int a,b;
        cin>>a>>b;
        a--;b--;
        graf[a].PB(b);
        graf[b].PB(a);
    }

    P[0]=0;
    makeTree(0);

    REP(i,1<<n){//{bit maska przedstawia czy krawedz wierzcholka i do ojca jest zablokowana}
        param=i;
        tKoszt=0;
        LL v1=dfs(0);
        tKoszt+=v1*v1;
        koszty[__builtin_popcount(i)]=min(koszty[__builtin_popcount(i)],tKoszt);
    }
    REP(i,n)
        cout<<koszty[i]<<" ";
    cout<<"\n";
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)
        go();
}