#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define pb push_back

typedef long long ll;
typedef long double ld;
const int mod = 2017;
int sum(int a, int b) {
    int s = a + b;
    if (s >= mod) s -= mod;
    return s;
}
int mult(int a, int b) {
    return (1LL * a * b) % mod;
}
int sub(int a, int b) {
    int s = a - b;
    if (s < 0) s += mod;
    return s;
}
int n;
const int maxN = 2e5 + 10;
int p[maxN];
int c[maxN];
int len[maxN];
const int BUBEN = 500;
//vector<int> f[maxN];
int link[maxN];
int ord[maxN];
int MEM[maxN / BUBEN + 2][maxN];
int cur[maxN];
vector<int> g[maxN];
int id[maxN];

gp_hash_table<int, int> f[maxN];


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
        len[i] = len[p[i]] + 1;
        g[p[i]].emplace_back(i);
    }
    for (int i = 1; i <= n; i++) {
        cin >> c[i];
        f[p[i]][c[i]] = i;
    }

    iota(ord + 1, ord + n + 1, 1);
    sort(ord + 1, ord + n + 1, [&](int x, int y) {
        return len[x] < len[y];
    });
    for (int x : g[0]) {
        MEM[0][c[x]] = x;
    }
    memset(id, -1, sizeof id);
    id[0] = 0;
    link[0] = 0;
    int SZ = 1;
    for (int who = 1; who <= n; who++) {
        int i = ord[who];
        int symb = c[i];
        if (p[i] == 0) {
            link[i] = 0;
        }
        else {
            int D = link[p[i]];
            int vert = -1;
            while (id[D] == -1) {
                if (f[D].find(symb) != f[D].end()) {
                    vert = f[D][symb];
                    break;
                }
                D = link[D];
            }
            if (vert == -1) {
                assert(id[D] != -1);
                vert = MEM[id[D]][symb];
            }
            link[i] = vert;
        }
        cur[i] = cur[link[i]] + 1;
        if (cur[i] >= BUBEN && SZ < maxN / BUBEN) {
            cur[i] = 0;
            for (int j = 1; j <= n; j++) {
                int D = i;
                int vert = -1;
                while (id[D] == -1) {
                    if (f[D].find(j) != f[D].end()) {
                        vert = f[D][j];
                        break;
                    }
                    D = link[D];
                }
                if (vert == -1) {
                    assert(id[D] != -1);
                    vert = MEM[id[D]][j];
                }
                MEM[SZ][j] = vert;
            }
            id[i] = SZ;
            SZ++;
        }
    }
    for (int i = 1; i <= n; i++) cout << link[i] << " ";
    return 0;
}