#include <fstream>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<stack>
#include<climits>
#include<deque>
using namespace std;

ifstream cin("cerere.in");
ofstream cout("cerere.out");

int k[100004];
int ans[100004];
bool pad[1000004];
vector<int>alese;
void dfs(int nod,vector<vector<int>>&v){
   alese.push_back(nod);
   if(k[nod]>0){
     ans[nod]=ans[alese[alese.size()-k[nod]-1]]+1;
   }
   else ans[nod]=0;

   for(int i=0;i<v[nod].size();i++){
     dfs(v[nod][i],v);
   }
   alese.pop_back();
}
int main()
{
   int n;
   cin>>n;
   for(int i=1;i<=n;i++)cin>>k[i];
   vector<vector<int>>v(n+1);
   for(int i=1;i<n;i++){
    int a,b;
    cin>>a>>b;
    v[a].push_back(b);
    pad[b]=1;
   }
   int rad=0;
   for(int i=1;i<=n;i++){
     if(pad[i]==0){
        rad=i;
        break;
     }
   }
   dfs(rad,v);
   for(int i=1;i<=n;i++)cout<<ans[i]<<" ";
   return 0;
}