#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 1e5 + 7;

vector<vector<int>> v(NMAX);
vector<int> inteligenta(NMAX, 0);
vector<int> father(NMAX, 0);
vector<int> up(NMAX, 0);
vector<int> ans(NMAX, 0);

void dfs(int nod, int lvl)
{
    up[lvl] = nod;
    if(inteligenta[nod])
    {
        ans[nod] = ans[up[lvl - inteligenta[nod]]] + 1;
    }

    for(auto i : v[nod])
    {
            dfs(i, lvl + 1);
    }
}

int main()
{
    int n;
    fin >> n;

    for(int i = 1; i <= n; i++)
    {
        fin >> inteligenta[i];
    }

    for(int i = 1; i < n; i++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
        father[y] = x;
    }

    for(int i = 1; i <= n; i++)
    {
        if(father[i] == 0)
        {
            dfs(i, 1);
            break;
        }
    }

    for(int i = 1; i <= n; i++)
    {
        fout << ans[i] << " ";
    }

    return 0;
}