#include <fstream>
#include <vector>

using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
const int lim=1e5+4;
vector<int> v[lim];
int a[lim],drum[lim];
int k[lim],sol[lim];
void df(int nod,int depth)
{
    drum[depth]=nod;
    if(k[nod]==0) sol[nod]=0;
    else sol[nod]=sol[drum[depth-k[nod]]]+1;
    for(int x:v[nod]) df(x,depth+1);
}
int main()
{
    int n,root,x,y;
    f>>n;
    for(int i=1;i<=n;++i)
        f>>k[i];
    for(int i=1;i<n;++i)
    {
        f>>x>>y;
        v[x].push_back(y);
        ++a[y];
    }
    root=0;
    for(int i=1;i<=n and !root;++i)
    if(!a[i]) root=i;
    df(root,1);
    for(int i=1;i<=n;++i)
    {
        g<<sol[i]<<' ';
    }
    return 0;
}