#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
const int dim = 100005;
bitset<dim>viz;
int rad, x, v[dim], lant[dim], k[dim], sol[dim];
vector<int>noduri[dim];
void dfs(int nod, int tata, int niv = 1)
{
    lant[niv] = nod;
    if(k[nod] != 0)
        sol[nod] = sol[lant[niv - k[nod]]] + 1;
    else
        sol[nod] = 0;
    for(auto it: noduri[nod])
    {
        if(it != tata)
            dfs(it, nod, niv + 1);
    }
}
int n;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
int main()
{
    fin >> n;
    for(int i = 1; i <= n; ++i)
        fin >> k[i];
    for(int  i = 1; i < n; ++i)
    {
        int x, y;
        fin >> x >> y;
        viz[y] = 1;
        noduri[x].push_back(y);
        noduri[y].push_back(x);
    }
    rad = 1;
    while(rad < n && viz[rad] == 1)
    {
        rad++;
    }
    k[rad] = 0;
    dfs(rad, 0, 1);
    for(int  i = 1; i <= n; ++i)
        fout << sol[i] << " ";
    return 0;
}