#include<fstream>
#include <vector>
using namespace std;
ifstream cin("cerere.in");
ofstream cout("cerere.out");
int n,x,y,k;
vector <int> a[100001];
vector <int> stac;
int v[100001];
int val[100001];
int rez[100001];
void dfs(int nr){
    v[nr]=1;
    for(int i=0;i<a[nr].size();i++){
        int vecin=a[nr][i];
        if(val[vecin]==0)
            rez[vecin]=0;
        else{
            rez[vecin]=rez[stac[stac.size()-val[vecin]]]+1;
        }
        stac.push_back(vecin);
        if(v[vecin]==0)
            dfs(vecin);
        stac.pop_back();

    }
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>val[i];
    for(int i=1;i<n;i++){
        cin>>x>>y;
        a[x].push_back(y);
    }
    stac.push_back(1);
    dfs(1);
    for(int i=1;i<=n;i++)
        cout<<rez[i]<<" ";
}