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
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<utility>
#include<functional>
#include<iomanip>
#include<sstream>
#include<ctime>
#include<cassert>
using namespace std;
#define y0 y0z
#define y1 y1z
#define yn ynz
#define j0 j0z
#define j1 j1z
#define jn jnz
#define tm tmz
#define buli(x) (__builtin_popcountll(x))
#define bur0(x) (__builtin_ctzll(x))
#define bul2(x) (63-__builtin_clzll(x))
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fil(a,b) memset((a),(b),sizeof(a))
#define cl(a) fil(a,0)
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define rep(i,a,b) for (int i=(a),_ed=(b);i<_ed;i++)
#define per(i,a,b) for (int i=(b)-1,_ed=(a);i>=_ed;i--)
#define forg(i,gu) for (int i=gu;~i;i=e[i].next)
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
void getre(){int x=0;printf("%d\n",1/x);}
void gettle(){int res=1;while(1)res<<=1;printf("%d\n",res);}
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename N,typename PN>inline N flo(N a,PN b){return a>=0?a/b:-((-a-1)/b)-1;}
template<typename N,typename PN>inline N cei(N a,PN b){return a>0?(a-1)/b+1:-(-a/b);}
template<typename N>N gcd(N a,N b){return b?gcd(b,a%b):a;}
template<typename N>inline int sgn(N a){return a>0?1:(a<0?-1:0);}
#if ( ( _WIN32 || __WIN32__ ) && __cplusplus < 201103L)
#define lld "%I64d"
#else
#define lld "%lld"
#endif
inline void gn(long long&x){
	int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');
	while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
#ifdef JCVB
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif
typedef long long ll;
typedef long double db;
inline ll sqr(ll a){return a*a;}
inline db sqrf(db a){return a*a;}
const int inf=0x3f3f3f3f;
//const ll inf=0x3f3f3f3f3f3f3f3fll;
const db pi=3.14159265358979323846264338327950288L;
const db eps=1e-6;
//const int mo=0;
//int qp(int a,ll b){int n=1;do{if(b&1)n=1ll*n*a%mo;a=1ll*a*a%mo;}while(b>>=1);return n;}

int n;
vector<pair<ll,ll> > f[333][333];
vector<int> ch[333];
ll a[333];






vector<pair<ll,ll> > prod(const vector<pair<ll,ll> > &a, const vector<pair<ll,ll> > &b) {
	vector<pair<ll,ll> > ans;
	rep(i,0,a.size())
		rep(j,0,b.size()) {
			ans.pb(mp(a[i].fi+b[j].fi, a[i].se-a[i].fi*a[i].fi+b[j].se-b[j].fi*b[j].fi + (a[i].fi+b[j].fi)*(a[i].fi+b[j].fi)));
		}
	sort(ans.begin(),ans.end());
	return ans;
}

int cro(pair<ll,ll> a,pair<ll,ll> b,pair<ll,ll> c) {
	db tt =db(b.fi-a.fi)*(c.se-a.se) - db(b.se-a.se)*(c.fi-a.fi);
	if(abs(tt)>1e17) return tt<=0;
	return (b.fi-a.fi)*(c.se-a.se) - (b.se-a.se)*(c.fi-a.fi)<=0;
}

void combin(vector<pair<ll,ll> > &v, vector<pair<ll,ll> > b) {// sorted
	rep(j,0,v.size()) b.pb(v[j]);
	sort(b.begin(),b.end());
	v.clear();
	rep(j,0,b.size()) {
		if(v.size()>=1 && b[j].second>=v.back().second)continue;
		while( v.size()>=2 && cro(v[v.size()-2],v[v.size()-1],b[j])) v.pop_back();
		v.pb(b[j]);
	}
}
int dfs(int u,int pa=-1) {
	int sz=1;  // choice 0<= .. <= sz
	vector<pair<ll,ll> > g[333],h[333];
	g[0].clear();
	g[0].pb(mp(a[u],a[u]*a[u]));
	for (int j=0;j<ch[u].size();j++) {
		int v=ch[u][j];
		if(v==pa)continue;
		int osz=sz,nsz=dfs(v,u);
		sz+=nsz;
		rep(aa,0,sz+1)h[aa].clear();
		rep(aa,0,osz)
			rep(b,0,nsz+1) {
				combin(h[aa+b], prod(g[aa],f[v][b]));
			}
		rep(aa,0,sz)g[aa]=h[aa];
		//rep(i,0,sz)
			//rep(k,0,g[i].size())printf("(%lld %lld),",g[i][k].first,g[i][k].second);
		//printf("\n");
	}
	per(i,0,sz) {
		pair<ll,ll> xx = g[i].back(); xx.first=0;
		vector<pair<ll,ll> > ss;ss.pb(xx);
		combin(g[i+1],ss);
	}
	rep(i,0,sz+1){
		f[u][i]=g[i];
		//printf("u=%d, i=%d: ",u,i);
		//rep(j,0,f[u][i].size())printf("(%lld %lld),",f[u][i][j].first,f[u][i][j].second);
	}
	return sz;
}
int main()
{
#ifdef JCVB
	//freopen("1.in","r",stdin);
	//freopen("1.out","w",stdout);
	int _time_jc=clock();
#endif
	int te;gn(te);
	while(te--){
		gn(n);
		rep(i,1,n+1) gn(a[i]);
		rep(i,1,n+1)ch[i].clear();
		rep(i,1,n) {
			int x,y;gn(x);gn(y);
			ch[x].pb(y);
			ch[y].pb(x);
		}
		dfs(1);
		rep(i,1,n+1) {
			cout<<f[1][i].front().second;
			if(i==n)cout<<endl;
			else cout<<" ";
		}

	}

#ifdef JCVB
	debug("time: %d\n",int(clock()-_time_jc));
#endif
	return 0;
}