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
/// Radoslaw Mysliwiec 2020
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

#define F first
#define S second
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define endl '\n'
#define dd cout << " debug";

using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int,int>;
using pll = pair<ll,ll>;
using matrix = vector<vll>;
//using ordered_set = tree<pi, null_type, less<pi>, rb_tree_tag, tree_order_statistics_node_update>;

int t, n;
ll tab[310];
ll res[310];
ll brute_dp[310];
vector<bool> brute_vis;
vector<int> g[310];

int brute_tree_dfs(int V, int bitmask) {
    brute_vis[V] = true;
    int neighbouring_sum = 0;
    for (auto u: g[V]) {
        if (!brute_vis[u] && (((bitmask >> (V-1)) & 1) ^ ((bitmask >> (u-1)) & 1)))
            neighbouring_sum += brute_tree_dfs(u, bitmask);
    }
    return tab[V] + neighbouring_sum;
}

void brute_solve() {
    for (int i=0; i<(1<<n); ++i) {
        brute_vis.assign(n+1, 0);
        int parts = 0;
        ll sum = 0;
        for (int j=1; j<=n; ++j) {
            if (brute_vis[j]) continue;
            ll tmp = brute_tree_dfs(j, i);
            sum += tmp * tmp;
            ++parts;
        }
        if (res[parts] > sum)
            res[parts] = sum;
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> t;

    while (t--) {
        cin >> n;

        for (int i=1; i<=n; ++i) {
            cin >> tab[i];
            g[i].clear();
            res[i] = 1e18;
        }
        for (int i=1; i<n; ++i) {
            int a, b;
            cin >> a >> b;
            g[a].push_back(b);
            g[b].push_back(a);
        }
        
        brute_solve();

        for (int i=1; i<=n; ++i)
            cout << res[i] << ' ';
        cout << endl;
    }
    
}