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
#include <bits/stdc++.h>
using namespace std;

void __print(int x) { cerr << x; }
void __print(int64_t x) { cerr << x; }
void __print(uint32_t x) { cerr << x; }
void __print(uint64_t x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template<typename T, typename V>
void __print(const pair<T, V> &x) { cerr << '('; __print(x.first); cerr << ", "; __print(x.second); cerr << ')'; }
template<typename T>
void __print(const T &x) { int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}"; }
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }

#ifndef ONLINE_JUDGE
#define debug(x...) cerr << " > [" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

struct Edge {
    int to, id;
    Edge(int _to, int _id) : to(_to), id(_id) {}
};

const int64_t oo = 1e15;
inline int pop(int x) { return __builtin_popcount(x); }

int64_t dfs(int u, int mask, vector<bool>& vis, const vector<vector<Edge>>& g, const vector<int64_t>& w) {
    vis[u] = true;
    int64_t subgraph_sum = 0;
    for(auto v : g[u]) {
        if(vis[v.to]) continue;
        if(mask & (1 << v.id)) continue;
        subgraph_sum += dfs(v.to, mask, vis, g, w);
    }
    return subgraph_sum + w[u];
}

int64_t sum(int mask, const vector<vector<Edge>>& g, const vector<int64_t>& w) {
    vector<bool> vis(w.size(), false);
    int64_t ret = 0;
    for(int i = 0; i < (int)w.size(); i++) {
        if(vis[i]) continue;
        int64_t cur = dfs(i, mask, vis, g, w);
        ret += cur * cur;
    }
    return ret;
}

void solve() {
    int n;
    cin >> n;
    vector<vector<Edge>> g(n);
    vector<int64_t> w(n);
    vector<int64_t> res(n, oo);
    for(int i = 0; i < n; i++) {
        cin >> w[i];
    }
    for(int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        u--; v--;
        g[u].emplace_back(v, i);
        g[v].emplace_back(u, i);
    }
    int len = (1 << (n - 1));
    for(int mask = 0; mask < len; mask++) {
        res[pop(mask)] = min(res[pop(mask)], sum(mask, g, w));
    }
    for(int64_t num : res) cout << num << " ";
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    int t;
    cin >> t;
    while(t--) solve();

    return 0;
}