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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
#include <bits/stdc++.h>
using namespace std;
//{
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define all(v) (v).begin(),(v).end()
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)


#define PII pair<int,int>
#define st first
#define nd second
#define pb push_back
#define lint long long int
#define VI vector<int>

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
};
//{
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} 
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue

#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);}
#define jeb() fflush(stdout);
//}


// ciag par (gora, waga) posortowany po gora malejaco
// przy czym zeby brac wiecej u gory to trzeba 
// sumarycznie mniej wazyc tzn.
// g2 > g1 => g2^2+w2 < g1^2+w1
#define DUPA vector<pair<lint,lint> >

int n;
int root;
VI g[305];
int par[305];
int w[305];
int pod[305];
// dp[v][k] <- mozliwe sytuacje po usunieciu 
// z wiercholka v, dokladnie k krawedzi
vector<DUPA> dp[305];

void ukorzen(int v) {
	pod[v] = 1;
	FORE(i, g[v]) {
		int w = *i;
		if (w != par[v]) {
			par[w] = v;
			ukorzen(w);
			pod[v] += pod[w];
		}
	}
}

lint licz(pair<lint, lint> x) {
	return x.st*1LL*x.st+x.nd;
}

pair<lint,lint> sumka(pair<lint, lint> x, pair<lint, lint> y) {
	return {x.st+y.st, x.nd+y.nd};
}

void rob(int v) {
	VI syny;
	FORE(i, g[v]) {
		int w = *i;
		if (w != par[v]) {
			rob(w);
			syny.pb(w);
		}
	}
	if (syny.size() == 0) {
		DUPA res = {{w[v]*1LL, 0LL}}; 
		dp[v].pb(res);
		return;
	}
	// dodaj mozliwosc uciecia syna od razu
	FOR(i,0,syny.size()) {
		int syn = syny[i];
		FOR(j,1,pod[syn]) {
			dp[syn][j].pb({0, licz(dp[syn][j-1][0])});
		}
		DUPA res = {{0, licz(dp[syn][pod[syn]-1][0])}};
		dp[syn].pb(res);
	}
	// bierz pierwszego syna
	int pierw = syny[0];
	FOR(i,0,pod[pierw]+1) dp[v].pb(dp[pierw][i]);
	int cur = pod[pierw];

	// kombinuj
	FOR(i,1,syny.size()) {
		int syn = syny[i];
		vector<DUPA> temp;
		FOR(i,0,cur+pod[syn]+1) {
			DUPA kij;
			FOR(j1,0,min(i+1,cur+1)) {
				int j2 = i - j1;
				if (j2 > pod[syn]) continue;
				FOR(j11,0,dp[v][j1].size()) {
					FOR(j22,0,dp[syn][j2].size()) {
						kij.pb(sumka(dp[v][j1][j11], dp[syn][j2][j22]));
					}
				}
			}
			DUPA good;
			sort(all(kij));
			good.pb(kij[0]);
			FOR(i,1,kij.size()) {
				lint ja = licz(kij[i]);
				lint on = licz(good.back());
				if (ja < on) {
					good.pb(kij[i]);
				}
			}
			reverse(all(good));
			temp.pb(good);
		}
		cur += pod[syn];
		dp[v] = temp;
	}
	// przesun o w[v] 
	FOR(i,0,pod[v]) {
		DUPA temp = dp[v][i];
		reverse(all(temp));
		dp[v][i].clear();
		FOR(j,0,temp.size()) {
			if (dp[v][i].size() == 0) dp[v][i].pb({temp[j].st+w[v], temp[j].nd});
			else {
				if (licz(dp[v][i].back()) > licz({temp[j].st+w[v], temp[j].nd})) 
					dp[v][i].pb({temp[j].st+w[v], temp[j].nd});
			}
		}
		reverse(all(dp[v][i]));
	}
}

void solve() {
	read(n);
	FOR(i,0,n) {
		make(a); 
		w[i] = a;
		g[i].clear();
		pod[i]=0;
	}
	// moze centrum lepsze? TBD
	root = 0; // rand() % n;
	FOR(i,0,n-1) {
		make2(a, b); a--; b--;
		g[a].pb(b); g[b].pb(a);
	}
	par[root] = -1;
	ukorzen(root);
	FOR(i,0,n) dp[i].clear();
	rob(root);
	FOR(i,0,n) {
		printf("%lld ", licz(dp[root][i][0])); 
	}
	printf("\n");
}


int main() {
	srand(time(NULL));
	make(z);
	while (z--) {
		solve();
	}
}