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
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
using namespace std;
typedef long long ll;typedef unsigned long long ull;
typedef double DB;typedef long double LD;
typedef __int128 i128;typedef pair<DB,DB> pdd;typedef pair<ll,bool> plb;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr3;typedef array<ll,2> arr2;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(1e9)+9;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;
ll N,M,Q,X,K,lT,A[MAXN];
vector<ll> g[MAXN];
bool vis[MAXN];
ll ans[MAXN];
ll mxx[2];
inline void init(){
mxx[0]=0;mxx[1]=0;
FOR(i,0,N+5){g[i].clear();vis[i]=false;}
}
void dfs(ll node,ll x0,ll x1,ll cnt){
if(vis[node]) return;
vis[node]=true;
ans[node]= cnt%2==0?A[node]+x1:A[node]+x0;
#ifdef LOCAL
debug(node);
debug(ans[node]);
debug(x0);
debug(x1);
debug(A[node]);
#endif
if(cnt%2==0){
x0-=A[node];
x1+=A[node];
}
if(cnt%2==1){
x0+=A[node];
x1-=A[node];
}
#ifdef LOCAL
debug(x0);
debug(x1);
cerr<<"\n";
#endif
FOR(i,0,SZ(g[node])-1){
ll lnode=g[node][i];
if(vis[lnode]) continue;
dfs(lnode,max(0ll,x0),max(0ll,x1),cnt+1);
}
}
inline void solve(){
cin>>N;
init();
FOR(i,1,N){cin>>A[i];}
FOR(i,1,N-1){
ll u,v;cin>>u>>v;
g[u].pb(v);g[v].pb(u);
}
dfs(1,0,0,1);
FOR(i,1,N){cout<<ans[i]<<" ";}
cout<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>lT;
while(lT--){
solve();
}
return 0;
}
|