#include <bits/stdc++.h>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
#define cout g
vector <int> v[INT_MAX], drum;
int t[INT_MAX], viz[INT_MAX], anc[INT_MAX], n, st, s[INT_MAX];
void dfs(int nod, int h)
{
    drum.push_back(nod);
    viz[nod]=1;
    s[nod]=1+s[drum[h-anc[nod]]];
    for(int i=0; i<v[nod].size(); i++)
    {
        if(!viz[v[nod][i]])
        {
            dfs(v[nod][i], h+1);
        }
    }
    //eliminam ultimul element din path
    drum.resize(drum.size()-1);
}
int main()
{
    f >> n;
    for(int i=1; i<=n; i++)
    {
        f >> anc[i];
        s[i]=-1;
        if(anc[i]==0 && st==0)
        {
            st=i;
        }
    }
    for(int i=1; i<=n-1; i++)
    {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    dfs(st,0);
    for(int i=1; i<=n; i++)
    {
        cout << s[i] << " ";
    }
    //0 1 0 1 2 0 1 1 2 1
}