#include <bits/stdc++.h>
using namespace std;

const int MAX = 100005;
vector<int> cost, parents, ans, st;
vector<int> graph[MAX];
bitset<MAX> visited;

void dfs(int node)
{
    visited[node] = 1;
    st.push_back(node);
    ans[node] = ans[st[st.size() - cost[node] - 1]];
    for (int next : graph[node])
        if (!visited[next])
            dfs(next);

    st.pop_back();
}

int main()
{
    ifstream cin("cerere.in");
    ofstream cout("cerere.out");
    int n;
    cin >> n;
    cost.assign(n+1, 0);
    parents.assign(n+1, 0);
    ans.assign(n+1, 0);

    for (int i = 1; i <= n; ++i)
        cin >> cost[i];

    for (int i = 1; i < n; ++i)
    {
        int x, y;
        cin >> x >> y;
        parents[y] = x;
        graph[x].push_back(y);
    }

    for (int root = 1; root <= n; ++root)
        if (!parents[root])
        {
            dfs(root);
            break;
        }

    for (int i = 1; i <= n; ++i)
        cout << ans[i] << " ";

    return 0;
}