#include<cstdio>
#include<vector>
#include<stack>

using namespace std;

const int nmax=1e5+5;

vector<int> g[nmax],st;
int k[nmax],rez[nmax];
bool tata[nmax];

inline void dfs(int node)
{
    if(k[node])
        rez[node]=rez[st[st.size()-k[node]]]+1;
    st.push_back(node);
    int i;
    for(i=0;i<g[node].size();++i)
        dfs(g[node][i]);
    st.pop_back();
}

int main()
{
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);
    int n,i,j;
    scanf("%d",&n);
    for(i=1;i<=n;++i)
        scanf("%d",&k[i]);
    int x,y;
    for(i=1;i<n;++i)
    {
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
        tata[y]=1;
    }
    for(i=1;i<=n;++i)
        if(!tata[i])
            dfs(i);
    for(i=1;i<=n;++i)
        printf("%d ",rez[i]);
}