#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define ll long long
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define readl(_s) getline(cin, (_s));
#define boost() cin.tie(0); cin.sync_with_stdio(0)

const int MN = 200005;

int n, c[MN], ans[MN];
vector<int> a[MN];
set<int> s[MN];

void dfs(int cur, int par) {
    int mx = 0, id = 0;
    for (int nxt : a[cur]) {
        if (nxt == par) continue;
        dfs(nxt, cur);
        if (s[nxt].size() > mx) mx = s[nxt].size(), id = nxt;
    }
    if (!id) {ans[cur] = 1; return;}
    swap(s[cur], s[id]);
    for (int nxt : a[cur]) {
        if (nxt == par || nxt == id) continue;
        for (int p : s[nxt]) s[cur].insert(p);
        s[nxt].clear();
    }
    s[cur].insert(c[cur]);
    ans[cur] = s[cur].size();
}

int main() {
    boost();

    cin >> n;
    for (int i = 1; i <= n; i++) cin >> c[i], s[i].insert(c[i]);
    for (int i = 1, u, v; i < n; i++) {
        cin >> u >> v;
        a[u].push_back(v);
        a[v].push_back(u);
    }
    dfs(1, 0);
    for (int i = 1; i <= n; i++) printf("%d ", ans[i]);

    return 0;
}

//https://mirror.codeforces.com/contest/1345/problem/B
//Author: BrownieTK
 
//#pragma GCC optimize("O3")
 
#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
//========================Debug======================================
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template <typename T, typename V>
void __print(const pair<T, V> &x)
{
    cerr << '{';
    __print(x.first);
    cerr << ',';
    __print(x.second);
    cerr << '}';
}
template <typename T>
void __print(const T &x)
{
    int f = 0;
    cerr << '{';
    for (auto &i : x)
        cerr << (f++ ? "," : ""), __print(i);
    cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v)
{
    __print(t);
    if (sizeof...(v))
        cerr << ", ";
    _print(v...);
}
#ifdef local
#define debug(x...)               \
    cerr << "[" << #x << "] = ["; \
    _print(x)
#else
#define debug(x...)
#endif
 
//========================TypeDefs===================================
 
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ldb;
 
typedef pair<lli, lli> pll;
typedef pair<int, int> pii;
typedef pair<int, lli> pil;
 
//=========================MACROS====================================
 
#define pb push_back
#define popb pop_back()
#define pf push_front
#define popf pop_front()
#define si size()
#define be begin()
#define en end()
#define all(v) v.be, v.en
#define mp make_pair
#define mt make_tuple
#define acc(v) accumulate(all(v), 0)
#define F first
#define S second
 
#define forz(i, n) for (int i = 0; i < n; i++)
#define fore(i, m, n) for (int i = m; i <= n; i++)
#define rforz(i, n) for (int i = n - 1; i >= 0; i--)
#define rfore(i, m, n) for (int i = n; i >= m; i--)
 
#define deci(n) fixed << setprecision(n)
#define high(n) __builtin_popcount(n)
#define highll(n) __builtin_popcountll(n)
#define parity(n) __builtin_parity(n)
#define clz(n) __builtin_clz(n)
#define clzll(n) __builtin_clzll(n)
#define ctz(n) __builtin_ctz(n)
 
#define bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
 
#define lb lower_bound
#define ub upper_bound
#define er equal_range
 
#define findnot find_first_not_of
 
#define maxe *max_element
#define mine *min_element
 
#define mod 1000000007
#define mod2 998244353
#define gcd __gcd
#define kira ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
 
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
 
#define oset tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define osetlli tree<lli, null_type, less<lli>, rb_tree_tag, tree_order_statistics_node_update>
 
#define ofk order_of_key
#define fbo find_by_order
//member functions :
//1. order_of_key(k) : number of elements sbtriectly lesser than k
//2. find_by_order(k) : k-th element in the set
 
//==============================FUNCTIONS===========================================
 
auto clk = clock();
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
void run_time()
{
#ifdef local
    cout << endl;
    cout << "Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
    return;
}
 
inline lli power(lli x, lli y, lli p = mod)
{
    lli res = 1;
    x = x % p;
    while (y > 0)
    {
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
inline lli modadd(lli a, lli b, lli m = mod)
{
    a += b;
    if (a >= m)
        a -= m;
    return a;
}
 
inline lli modmul(lli a, lli b, lli m = mod)
{
    return ((a % m) * (b % m)) % m;
}
 
inline lli modi(lli a, lli m = mod) { return power(a, m - 2, m); }
 
//================================CODE=============================================
inline int64_t gilbertOrder(int x, int y, int pow, int rotate)
{
    if (pow == 0)
    {
        return 0;
    }
    int hpow = 1 << (pow - 1);
    int seg = (x < hpow) ? (
                               (y < hpow) ? 0 : 3)
                         : (
                               (y < hpow) ? 1 : 2);
    seg = (seg + rotate) & 3;
    const int rotateDelta[4] = {3, 0, 0, 1};
    int nx = x & (x ^ hpow), ny = y & (y ^ hpow);
    int nrot = (rotate + rotateDelta[seg]) & 3;
    int64_t subSquareSize = int64_t(1) << (2 * pow - 2);
    int64_t ans = seg * subSquareSize;
    int64_t add = gilbertOrder(nx, ny, pow - 1, nrot);
    ans += (seg == 1 || seg == 2) ? add : (subSquareSize - add - 1);
    return ans;
}
struct query
{
    int l, r, idx;
    int64_t ord;
    inline void calcOrder()
    {
        ord = gilbertOrder(l, r, 21, 0);
    }
};
 
const int N = 2e5 + 5;
vector<int> adj[N];
vector<int> v;
int siz[N];
int pos[N];
int timer = 0;
int a[N], cnt[N], ans[N], arr[N];
map<int, int> m;
int len, res = 0;
int n, q, ql, qr, y;
vector<query> mo;
 
void dfs(int s = 0, int e = -1)
{
    siz[s] = 1;
    v.pb(s);
    for (auto u : adj[s])
    {
        if (u == e)
            continue;
        dfs(u, s);
        siz[s] += siz[u];
    }
}
 
bool compare(query a, query b)
{
    return a.ord < b.ord;
}
 
void add(int idx)
{
    if (cnt[a[idx]] == 0)
        res++;
    cnt[a[idx]]++;
}
void remove(int idx)
{
    cnt[a[idx]]--;
    if (cnt[a[idx]] == 0)
        res--;
}
void compute()
{
    //algo for zero based queries
    int l = 0, r = -1;
    for (query u : mo)
    {
        while (l > u.l)
        {
            l--;
            add(l);
        }
        while (r < u.r)
        {
            r++;
            add(r);
        }
        while (l < u.l)
        {
            remove(l);
            l++;
        }
        while (r > u.r)
        {
            remove(r);
            r--;
        }
        ans[u.idx] = res;
    }
}
int main()
{
    kira;
    cin >> n;
    forz(i, n)
    {
        cin >> y;
        if (m.count(y))
            arr[i] = m[y];
        else
        {
            arr[i] = int(m.si);
            m[y] = arr[i];
        }
    }
    int eu, ev;
    forz(i, n - 1)
    {
        cin >> eu >> ev;
        eu--;
        ev--;
        adj[eu].pb(ev);
        adj[ev].pb(eu);
    }
 
    dfs();
 
    forz(i, n)
    {
        pos[v[i]] = i;
        a[i] = arr[v[i]];
    }
 
    len = int(sqrt(n + .0)) + 1;
 
    forz(i, n)
    {
        ql = pos[i];
        qr = pos[i] + siz[i] - 1;
        query x;
        x.l = ql;
        x.r = qr;
        x.idx = i;
        x.calcOrder();
        mo.pb(x);
    }
    sort(all(mo), compare);
 
    compute();
    forz(i, n) p0(ans[i]);
    //run_time();
    return 0;
}