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

ifstream in("cerere.in");
ofstream out("cerere.out");

const int N_MAX = 1e5;

int n;
int k[N_MAX + 2];
vector<int> gr[N_MAX + 2];

int top;
int st[N_MAX + 2], ans[N_MAX + 2];

void dfs(int node, int daddy)
{
    st[++top] = node;
    if(k[node])
        ans[node] = ans[st[top - k[node]]] + 1;

    for(auto it: gr[node])
        if(it != daddy)
            dfs(it, node);

    top--;
}

int main()
{
    in >> n;
    for(int i = 1; i <= n; i++)
        in >> k[i];

    int root = n * (n + 1) / 2;
    for(int i = 1; i < n; i++)
    {
        int x, y;
        in >> x >> y;
        gr[x].push_back(y);

        root -= y;
    }

    dfs(root, 0);

    for(int i = 1; i <= n; i++)
        out << ans[i] << ' ';
    out << '\n';

    return 0;
}