#include <cstdio>
#include <cctype>
 
class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;
 
    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }
 
public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }
    
    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
    
    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

#include <fstream>
#include <vector>
#include <queue>
using namespace std;

InParser fin("cerere.in");
ofstream fout("cerere.out");

int k[100001];
vector <int> v[100001], a[100001];
int rmq[18][100001];
int dp[100001];

queue <int> q;

int sus(int x, int nr)
{
    int i;
    for (i = 0; (1<<i) <= nr; i++)
        if (nr & (1<<i))
            x = rmq[i][x];
    return x;
}

void bfs(int s)
{
    int na, i;
    q.push(s);
    while (q.empty() == 0)
    {
        na = q.front();
        q.pop();
        for (i = 0; i<a[na].size(); i++)
            dp[a[na][i]] = 1 + dp[na];
        for (i = 0; i<v[na].size(); i++)
            q.push(v[na][i]);
    }
}

int main()
{
    int n, i, j, x, y, r;
    fin >> n;
    for (i = 1; i<=n; i++)
        fin >> k[i];
    for (i = 1; i<n; i++)
    {
        fin >> x >> y;
        rmq[0][y] = x;
        v[x].push_back(y);
    }
    for (r = 1; rmq[0][r] != 0; r++);
    for (i = 1; (1<<i)<=n; i++)
        for (j = 1; j<=n; j++)
            rmq[i][j] = rmq[i-1][rmq[i-1][j]];
    for (i = 1; i<=n; i++)
        if (k[i] > 0)
            a[sus(i, k[i])].push_back(i);
    bfs(r);
    for (i = 1; i<=n; i++)
        fout << dp[i] << ' ';
    return 0;
}