#include <fstream>
#include <vector>
using namespace std;

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

#define NMAX 100005

vector<int> G[NMAX];

int k[NMAX], viz[NMAX];
int rez[NMAX], lant[NMAX];
int tata[NMAX];

void dfs(int nod, int niv)
{
    viz[nod] = 1;
    lant[niv] = nod;

    if (k[nod])
        rez[nod] = rez[lant[niv - k[nod]]] + 1;

    for (auto it : G[nod])
        if (!viz[it])
            dfs(it, niv + 1);
}

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

    for (int i = 1; i <= n; ++i)
        fin >> k[i];

    for (int i = 1; i < n; ++i)
    {
        int a, b;
        fin >> a >> b;
        G[a].push_back(b);
        tata[b] = a;
    }

    bool gasit = 0;

    for (int i = 1; i <= n && !gasit; ++i)
        if (tata[i] == 0)
        {
            dfs(i, 1);
            gasit = 1;
        }

    for (int i = 1; i <= n; ++i)
        fout << rez[i] << ' ';
    return 0;
}