#include <fstream>
#include <vector>

using namespace std;
ifstream cin("cerere.in");
ofstream cout("cerere.out");
int n,mx,N;
int A[100005],gradI[100005],ans[100005];
vector<int> G[100005],subRoot;
void dfs(int x)
{
    N++;
    subRoot.push_back(x);
    if(A[x]==0)
        ans[x]=0;
    else
        ans[x]=ans[subRoot[N-A[x]]]+1;
    for(auto y:G[x])
        dfs(y);
    N--;
    subRoot.pop_back();
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>A[i];
    for(int i=1;i<=n-1;i++)
    {
        int x,y;
        cin>>x>>y;
        G[x].push_back(y);
        gradI[y]++;
    }
    int root;
    for(int i=1;i<=n;i++)
        if(!gradI[i])
    {
        root=i;
        break;
    }
    subRoot.push_back(0);
    dfs(root);
    for(int i=1;i<=n;i++)
        cout<<ans[i]<<" ";
    return 0;
}