#include <bits/stdc++.h>

std :: ifstream in ("cerere.in");

std :: ofstream out ("cerere.out");

const int NMAX = 1e5 + 5;

int n;

int cerere[NMAX];

int x;

int y;

std :: vector <int> v[NMAX];

bool tatal[NMAX];

int start;

int ret[NMAX];


int stramos[NMAX];

void dfs(int nod, int cnt)
{
    cnt ++;

    stramos[cnt] = nod;

    if(!cerere[nod])
    {
        ret[nod] = 0;
    }
    else
    {
        ret[nod] = 1 + ret[stramos[cnt - cerere[nod]]];
    }

    for(int i : v[nod])
    {
        dfs(i, cnt);
    }
}

int main()
{

    in >> n;

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

    for(int i = 1; i < n; i ++)
    {
        in >> x >> y;

        v[x].push_back(y);
    }

    for(int i = 1; i <= n; i ++)
    {
        for(int j : v[i])
        {
            tatal[j] = true;
        }
    }

    for(int i = 1; i <= n; i ++)
    {
        if(tatal[i] == false)
        {
            start = i;
        }
    }

    int cnt = 0;

    stramos[1] = start;

    dfs(start, cnt);

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

    return 0;
}