#include <bits/stdc++.h>
#define maxN 100002
using namespace std;
int n, r, i, j, v[maxN], t[maxN], sol[maxN];
bool w[maxN];
vector < int > V[maxN];
void read()
{
    int x, y;
    freopen("cerere.in", "r", stdin);
    scanf("%d", &n);
    for (i = 1; i <= n; ++ i)
        scanf("%d", &v[i]);
    for (i = 1; i < n; ++ i)
    {
        scanf("%d %d", &x, &y);
        V[x].push_back(y);
        w[y] = 1;
    }
}
void dfs(int x, int y)
{
    int i;
    t[y] = x;
    for (int son : V[x])
    {
        if (v[son])
            sol[son] = sol[t[y - v[son] + 1]] + 1;
        else
            sol[son] = 0;
        dfs(son, y + 1);
    }
}
void solve()
{
    int i;
    for (i = 1; i <= n; ++ i)
        if (!w[i])
        {
            r = i;
            break;
        }
    dfs(r, 1);
}
void write()
{
    freopen("cerere.out", "w", stdout);
    for (i = 1; i <= n; ++ i)
        printf("%d ", sol[i]);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}