#include<cstdio>
#include<vector>
using namespace std;
const int N=100000;
vector<int>g[N+1];
bool bun[N+1];
bool vis[N+1];
int res[N+1];
int st[N+1];
int v[N+1];
int n,l,adanc;
void dfs(int dad){
    l++;
    if(v[dad])
        st[l]=st[l-v[dad]]+1;
    vis[dad]=true;
    for(unsigned int i=0;i<g[dad].size();i++){
        int son=g[dad][i];
        if(!vis[son])
            dfs(son);
    }
    res[dad]=st[l];
    st[l]=0;
    l--;
}
int main(){
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&v[i]);
    for(int i=1;i<n;i++){
        int x,y;
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
        g[y].push_back(x);
        bun[y]=true;
    }
    int rad;
    for(int i=1;i<=n;i++)
        if(!bun[i]){
            rad=i;
            break;
        }
    dfs(rad);
    for(int i=1;i<=n;i++)
        printf("%d ",res[i]);
    return 0;
}