CF600E E. Lomsat gelral

E. Lomsat gelral

//#include <bits/stdc++.h>
//#pragma GCC optimize(2)
#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <iostream>
#include <map>
#include <cmath>
#include <set>
#include <time.h>
#include <stdlib.h>
#include <random>

#define go(i, l, r) for(ll i = (l), i##end = (ll)(r); i <= i##end; ++i)
#define god(i, r, l) for(ll i = (r), i##end = (ll)(l); i >= i##end; --i)
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define debug_in  freopen("in.txt","r",stdin)
#define debug_out freopen("out.txt","w",stdout);
#define pb push_back
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 bigll;
typedef pair<ll,ll> pii;
const ll inf_int = 1e9+10;
const ll inf_ll = 1e18;

void read(int &x){
    scanf("%d",&x);
}
void read(ll &x){
    scanf("%lld",&x);
}
template<class H, class... T> void read(H& h, T&... t) {
    read(h);
    read(t...);
}

void pt(){ cout<<'\n';}
template<class H, class ... T> void pt(H h,T... t){ cout<<" "<<h; pt(t...);}

//--------------------------------------------
const ll maxn = 2e5 + 10;
ll N;
ll col[maxn];
ll h[maxn],e[maxn],ne[maxn],idx = 1;
ll cnt[maxn],mx,sum;
ll ans[maxn],sz[maxn],hson[maxn];
void add(ll a ,ll b){
    e[++idx] = b;
    ne[idx] = h[a];
    h[a] = idx;
}
void dfs1(ll u,ll fa){
    sz[u] = 1;
    hson[u] = -1;
    for(ll i = h[u];i;i = ne[i]){
        ll v = e[i];
        if(v == fa) continue;
        dfs1(v,u);
        if(hson[u] == -1 || sz[v] > sz[hson[u]]){
            hson[u] = v;
        }
        sz[u] += sz[v];
    }
}
void update(ll u,ll fa,ll val){
    cnt[col[u]] += val;
    if(val == +1){
        if(cnt[col[u]] == mx) sum += col[u];
        else if(cnt[col[u]] > mx) sum = col[u],mx = cnt[col[u]];
    }else mx = 0,sum = 0;
    for(ll i = h[u];i;i = ne[i]){
        ll v = e[i];
        if(v == fa) continue;
        update(v,u,val);
    }
}
void dfs2(ll u,ll fa,ll op){
    for(ll i = h[u];i;i = ne[i]){
        ll v = e[i];
        if(v == fa || v == hson[u]) continue;
        dfs2(v,u,0);
    }
    if(hson[u] != -1){
        dfs2(hson[u],u,1);
    }
    for(ll i = h[u];i;i = ne[i]){
        ll v = e[i];
        if(v == fa || v == hson[u]) continue;
        update(v,u,+1);
    }
    cnt[col[u]] += 1;
    if(cnt[col[u]] == mx) sum += col[u];
    else if(cnt[col[u]] > mx) sum = col[u],mx = cnt[col[u]];
    ans[u] = sum;
    if(!op){
        update(u,fa,-1);
    }
}
int main() {
//    debug_in; debug_out;

    read(N);
    for(ll i = 1;i<=N;i++) read(col[i]);
    for(ll i = 1;i<=N-1;i++){
        ll a,b;read(a,b);
        add(a,b);
        add(b,a);
    }
    dfs1(1,-1);
    dfs2(1,-1,1);
    for(ll i = 1;i<=N;i++) printf("%lld ",ans[i]);
    return 0;
}