#include <fstream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
ifstream fin("cerere.in");
ofstream fout("cerere.out");
 
vector <int> l[100005];
 
int d[100005],k[100005],af[100005];
bool v[100005];
 
void dfs(int nod, int niv)
{
    v[nod]=1;
    d[niv]=nod;
    af[nod]=af[d[niv-k[nod]]]+1;
    for (int i=0;i<l[nod].size();i++)
    {
        int vec=l[nod][i];
        if (v[vec]==0)
        {
            dfs(vec,niv+1);
        }
    }
}
 
int n,r,i,x,y;
bool v1[100005];
 
int main()
{
    fin >> n;
    for (i=1;i<=n;i++) fin >> k[i];
    for (i=1;i<n;i++)
    {
        fin >> x >> y;
        v1[y]=1;
        l[x].push_back(y);
        l[y].push_back(x);
    }
    for (i=1;i<=n;i++) if (v1[i]==0) r=i;
    dfs(r,1);
    for (i=1;i<=n;i++) fout << af[i]-1 << " ";
 
    return 0;
}