// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
#else
#define debug(x...)
#define Debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define VI vector<int>
#define VII vector<vector<int>>
#define VIII vector<vector<vector<int>>>
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define MAXN 200010

struct tree {
    int n;
    vector<vector<int>> e;
    struct node {
        vector<node*> ch;
        node *parent = nullptr;
        int size, depth, val, dfn;
        node *heavy = nullptr, *top = nullptr;
    };
    vector<node> vertex;
    node *root;
    tree(int V) {
        n = V;
        e.resize(n);
        vertex.resize(n);
    }
    void add_edge(int u, int v) {
        e[u].push_back(v), e[v].push_back(u);
    }
    int ind(node *x) {return x - &vertex[0]; }
    void build(int rt = 0) {
        function<void(int, int)> dfs = [&](int u, int pre) {
            node *x = &vertex[u];
            x->size = 1;
            x->depth = x==root ? 0 : x->parent->depth + 1;
            for (int v: e[u]) {
                if (v == pre) continue;
                node *y = &vertex[v];
                x->ch.push_back(y);
                y->parent = x;
                dfs(v, u);
                x->size += y->size;
                if (!x->heavy || y->size > x->heavy->size) x->heavy = y;
            }
        };
        root = &vertex[rt];
        dfs(rt, -1);
    }
    void graphviz_dump(int plus = 0, string filename = "graph.dot") {
        string vlabel = "", elabel = "";
        // vlabel = " color=\"red\"";
        elabel = " color=\"red\"";
        set<int> vset; set<pair<int, int>> eset;
        rep(i, 0, n) if (vertex[i].heavy) vset.insert(ind(vertex[i].heavy)), eset.insert({i, ind(vertex[i].heavy)});
        FILE *f = fopen(filename.c_str(), "w");
        fprintf(f, "digraph Tree {\n");
        rep(i, 0, n) {
            node *x = &vertex[i];
            fprintf(f, "    %lld;\n", vset.count(i) ? vlabel.c_str() : "");
        }
        rep(i, 0, n) {
            node *x = &vertex[i];
            for (auto y: x->ch) {
                fprintf(f, "    %ld -> %ld[arrowhead=\"none\"%s];\n", x - &vertex[0], y - &vertex[0], eset.count({i, ind(y)}) ? elabel.c_str() : "");
            }
        }
        fprintf(f, "}\n");
    }

    pair<vector<int>, vector<pair<int, int>>> dfsorder(int single = 0) {
        vector<int> order;
        vector<pair<int, int>> ts(n);
        int cnt = 0;
        function<void(node*)> dfs = [&](node *x) {
            ts[ind(x)].first = cnt++;
            order.push_back(ind(x));
            for (auto y: x->ch) dfs(y);
            if (!single) order.push_back(ind(x));
            ts[ind(x)].second = single ? cnt-1 : cnt++;
        };
        dfs(root);
        return {order, ts};
    }
    void dsu(auto add, auto del, auto setans) {
        auto [order, ts] = dfsorder(1);
        function<void(node*, int)> dfs = [&](node *x, int keep) {
            for (auto y: x->ch) if (x->heavy && y != x->heavy) dfs(y, 0);
            if (x->heavy) dfs(x->heavy, 1);
            for (auto y: x->ch) if (x->heavy && y != x->heavy) {
                rep(i, ts[ind(y)].first, ts[ind(y)].second+1) add(&vertex[order[i]]);
            }
            add(x);
            setans(ind(x));
            if (!keep) rep(i, ts[ind(x)].first, ts[ind(x)].second+1) del(&vertex[order[i]]);
        };
        dfs(root, 0);
    }
};

int corcomp(vector<int> &a) {
    int maxv = 0;
    vector<pair<int, int>> l(sz(a)), r(sz(a));
    rep(i, 0, sz(a)) l[i] = {a[i], i};
    sort(l.begin(), l.end());
    r[0] = {l[0].second, 0};
    rep(i, 1, sz(a)) {
        r[i].first = l[i].second;
        r[i].second = r[i-1].second + (l[i].first != l[i-1].first);
    }
    maxv = r.back().second;
    sort(r.begin(), r.end());
    rep(i, 0, sz(a)) a[i] = r[i].second;
    return maxv;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n);
    rep(i, 0, n) cin >> a[i];
    int N = corcomp(a);
    tree g(n);
    rep(i, 0, n) g.vertex[i].val = a[i];
    rep(i, 0, n-1) {
        int u, v; cin >> u >> v; --u, --v;
        g.add_edge(u, v);
    }
    g.build(0);
    // g.graphviz_dump(0);
    vector<int> cnt(N+1, 0), ans(n, 0);
    int total = 0;
    auto add = [&](tree::node *x) {
        if (cnt[x->val]++ == 0) ++total;
    };
    auto del = [&](tree::node *x) {
        if (--cnt[x->val] == 0) --total;
    };
    auto setans = [&](int x) {
        ans[x] = total;
    }; 
    g.dsu(add, del, setans);
    rep(i, 0, n) cout << ans[i] << " \n"[i==n-1];

    return 0;
}