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
 98
 99
100
101
102
103
104
105
106
107
108
109
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>

using namespace std;

const int nax = 44;

ll a[nax];

vector<int> adj[nax];

int n;

bool blocked[nax];

ll ans[nax];

ll sum = 0;
ll cur = 0;

int parent[nax];

void dfs2(int v,int p)
{
    parent[v] = p;
    for(int x : adj[v])
    {
        if(x != p) dfs2(x,v);
    }
}

bool vis[nax];

void dfs(int v)
{
    vis[v] = true;
    cur += a[v];
    for(int x : adj[v])
    {
        if(vis[x] == false)
        {
            if(parent[x] == v && blocked[x]) continue;
            if(parent[v] == x && blocked[v]) continue;
            dfs(x);
        }
    }
}

void solve()
{
    cin>>n;
    for(int i=1;i<=n;i++) adj[i].clear();
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<n;i++)
    {
        int x,y; cin>>x>>y;
        adj[x].pb(y);
        adj[y].pb(x);
    }

    // root in n

    dfs2(n,0);

    for(int i=1;i<=n;i++) ans[i] = 2e18 + 5;
    for(int i=0;i<(1<<(n-1));i++)
    {
        for(int j=1;j<=n;j++) blocked[j] = false;

        for(int j=0;j<n-1;j++)
        {
            if(i & (1<<j)) blocked[j + 1] = true;
        }

        for(int j=1;j<=n;j++) vis[j] = false;

        sum = 0;

        for(int j=1;j<=n;j++)
        {
            if(vis[j] == false)
            {
                cur = 0;
                dfs(j);
                sum += cur * cur;
            }
        }

        ans[__builtin_popcount(i) + 1] = min(ans[__builtin_popcount(i) + 1], sum);
    }

    for(int i=1;i<=n;i++) cout<<ans[i]<<" ";
    cout<<"\n";

}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t; cin>>t;
    while(t--) solve();
    return 0;
}