#include<cstdio>
#include<fstream>
#include<vector>
#define nmax 100010
using namespace std;
vector<int>g[nmax];
int n,k[nmax],dad[nmax],i,sol[nmax],viz[nmax],prec[nmax],q[nmax],x,y,nr;
void dfs(int);
int main()
{
    ifstream fin("cerere.in");
    ofstream fout("cerere.out");
    fin>>n;
    for(i=1;i<=n;++i)fin>>k[i];
    for(i=1;i<n;++i){fin>>x>>y;g[x].push_back(y);dad[y]=x;}
    for(i=1;i<=n&&dad[i];++i);
    dfs(i);
    for(i=1;i<=n;++i)
        fout<<sol[i]<<' ';
    return 0;
}
void dfs(int maimuta)
{
    viz[maimuta]=1;
    q[++nr]=maimuta;
    prec[maimuta]=q[nr-k[maimuta]];
    if(prec[maimuta]!=maimuta)sol[maimuta]=sol[prec[maimuta]]+1;
    for(vector<int>::iterator it=g[maimuta].begin();it!=g[maimuta].end();++it)
        if(!viz[*it])
            dfs(*it);
    q[nr]=0;
    --nr;
}