#include <fstream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin ("cerere.in");
ofstream fout("cerere.out");
int n,i,K[100003],x,y,k,viz[100003],D[100003],sort_top[100003],root;
vector <int> L[100003];
void dfs(int nod)
{
    sort_top[++k]=nod;
    if(K[nod])
        D[nod]=1+D[sort_top[k-K[nod]]];
    for(auto j:L[nod])
        dfs(j);
    k--;
}
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>K[i];
    for(i=1;i<n;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
        viz[y]=1;
    }
    for(i=1;i<=n;i++)
        if(!viz[i])
            root=i;
    dfs(root);
    for(i=1;i<=n;i++)
        fout<<D[i]<<" ";
    return 0;
}