#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000 + 5;

int N, a[MAX_N], ai[MAX_N];
int fath[MAX_N], anc[MAX_N];
vector<int> son[MAX_N];

int get_anc(int x) {
	return anc[x] == x ? x : anc[x] = get_anc(anc[x]);
}
void dfs(int u) {
	reverse(son[u].begin(), son[u].end());
	for (int v: son[u]) {
		dfs(v);
	}
	printf("%d%c", u, u > 1 ? ' ' : '\n');
}

int main() {
	scanf("%d", &N);
	for (int i = 2; i <= N; i ++) {
		scanf("%d", &fath[i]);
	}
	for (int i = 1; i <= N; i ++) {
		scanf("%d", &a[i]);
		ai[i] = i;
		anc[i] = i;
	}
	sort(ai + 1, ai + 1 + N, [] (int i, int j) {
		return a[i] < a[j];
	});
	for (int i = N; i >= 1; i --) {
		int x = ai[i];
		if (x == 1) continue;
		int y = get_anc(fath[x]);
		son[y].push_back(x);
		anc[x] = fath[x];
	}
	dfs(1);
	return 0;
}