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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

typedef long long int LL;

const int MAXN = 305;
const LL INF = 100000000000000000LL;

int n;
vector<int> adj[MAXN];
int sz[MAXN];
LL cost[MAXN];
//gp_hash_table<int,LL> dp[MAXN][MAXN], ndp[MAXN][MAXN];
unordered_map<int,LL> dp[MAXN][MAXN], ndp[MAXN][MAXN];

void read() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> cost[i];
  for (int i = 0; i < n-1; i++) {
    int u, v;
    cin >> u >> v; u--; v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
}

inline LL sqr(LL x) { return x * x; }

inline void update(int u, int k, int x, LL v, bool immediate) {
  if (immediate) {
    if ((dp[u][k].find(x) == dp[u][k].end()) || (dp[u][k][x] > v)) dp[u][k][x] = v;
  }
  else {
    if ((ndp[u][k].find(x) == ndp[u][k].end()) || (ndp[u][k][x] > v)) ndp[u][k][x] = v;
  }
}

void remove_redundant(int u, int k) {
  vector<pair<int,LL>> dpuk(dp[u][k].begin(), dp[u][k].end());
  sort(dpuk.begin(), dpuk.end());

  vector<pair<int,LL>> non_redundant;
  for (const pair<int,LL>& x : dpuk) {
    if (!non_redundant.empty()) {
      const pair<int,LL>& y = non_redundant.back();
      LL back_cost = y.second + sqr(y.first);
      LL next_cost = x.second + sqr(x.first);
      if (back_cost < next_cost) continue;
    }
    non_redundant.push_back(x);
  }

  //dp[u][k] = gp_hash_table<int,LL>(non_redundant.begin(), non_redundant.end());
  dp[u][k] = unordered_map<int,LL>(non_redundant.begin(), non_redundant.end());
}

LL a_max;

void compute(int u, int parent) {
  sz[u] = 1;
  dp[u][0][cost[u]] = 0;

  for (int v : adj[u])
    if (v != parent) {
      compute(v, u);

      for (int kv = 0; kv <= sz[v]; kv++)
        for (int ku = 0; ku <= sz[u]; ku++) {
          if ((dp[v][kv].empty()) || (dp[u][ku].empty())) continue;

          LL x_threshold = a_max * n * 1.1 / (ku + kv + 1) + a_max * 4;

          for (const pair<int,LL>& xv : dp[v][kv])
            for (const pair<int,LL>& xu : dp[u][ku]) {
              if (xu.first + xv.first > x_threshold) continue;
              update(u, ku + kv, xu.first + xv.first,
                     xu.second + xv.second, false);
            }
        }

      sz[u] += sz[v];
      for (int k = 0; k <= sz[u]; k++) {
        dp[u][k] = ndp[u][k];
        ndp[u][k].clear();
      }
    }

  for (int k = sz[u]; k >= 0; k--) {
    for (const pair<int,LL> x : dp[u][k])
      if (x.first > 0)
        update(u, k + 1, 0, x.second + sqr(x.first), true);
  }

  for (int k = 0; k <= sz[u]; k++)
    remove_redundant(u, k);

  for (int v : adj[u])
    if (v != parent)
      for (int k = 0; k <= sz[v]; k++)
        dp[v][k].clear();
}

void cleanup() {
  for (int i = 0; i < n; i++) { adj[i].clear(); adj[i].shrink_to_fit(); }
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= n; j++)
      dp[i][j].clear();
  for (int i = 0; i < n; i++) sz[i] = 0;
}

int dist[MAXN], rsz[MAXN];

void dfs(int u, int parent) {
  rsz[u] = 1;
  for (int v : adj[u])
    if (v != parent) {
      dfs(v, u);
      dist[v] = dist[u] + 1;
      rsz[u] += rsz[v];
    }
}

LL root_value(int u, int parent) {
  LL total_rsz = 0;

  for (int v : adj[u])
    if (v != parent)
      total_rsz += root_value(v, u);

  for (int p1 = 0; p1 < adj[u].size(); p1++)
    for (int p2 = p1+1; p2 < adj[u].size(); p2++) {
      int v1 = adj[u][p1];
      int v2 = adj[u][p2];
      if ((v1 == parent) || (v2 == parent)) continue;
      total_rsz += rsz[v1] * rsz[v2];
    }

  return total_rsz;
}

void solve() {
  read();

  a_max = 0;
  for (int i = 0; i < n; i++) a_max = max(a_max, cost[i]);
  a_max = a_max * (n+1) / n;

  int best_root = 0;
  LL best_root_val = INF;
  for (int i = 0; i < n; i++) {
    dist[i] = 0;
    dfs(i, -1);
    LL root_val = root_value(i, -1);
    if (root_val < best_root_val) {
      best_root = i;
      best_root_val = root_val;
    }
  }

  compute(best_root, -1);

  for (int i = 1; i <= n; i++) {
    if (i >= 2) cout << " ";
    cout << dp[best_root][i][0];
  }
  cout << "\n";

  cleanup();
}

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

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

  return 0;
}