#include <fstream>

using namespace std;

const int N = 100000;
int pas[N + 1];
int t[N + 1];

int drum(int a, int k)
{
    while (k > 0)
    {
        a = t[a];
        k --;
    }
    return a;
}
int dist(int a)
{
    if (pas[a] == 0)
    {
        return 0;
    }
    return 1 + dist(drum(a, pas[a]));
}
int main()
{
    ifstream in("cerere.in");
    ofstream out("cerere.out");

    int n;
    in >> n;
    for (int i = 1; i <= n; i ++)
    {
        in >> pas[i];
    }
    for (int i = 1; i <= n; i ++)
    {
        int x, y;
        in >> x >> y;
        t[y] = x;
    }

    for (int i = 1; i <= n; i ++)
    {
        out << dist(i) << ' ';
    }

    in.close();
    out.close();

    return 0;
}