#include<bits/stdc++.h>
using namespace std;

int N, cnt = 0;
int fa[100005];
vector<int> E[100005];
int r[100005], val[100005];
bool vis[100005];
int son[100005];

void dfs(int u){
	son[u] = -1;
	for (auto && v : E[u]){
		if (vis[v]) continue;
		dfs(v);
		if (r[v] < r[u]){
			son[u] = v;
			r[u] = r[v];
		}
	}
	r[u] = min(r[u], val[u]);
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif

	scanf("%d", &N);
	for (int i = 2; i <= N; i ++){
		scanf("%d", &fa[i]);
		E[fa[i]].push_back(i);
	}
	for (int i = 1; i <= N; i ++){
		scanf("%d", &val[i]);
	}
	while (cnt < N){
		memset(r, 0x3f, 4 * N + 10);
		dfs(1);
		int pos = 1;
		while (son[pos] != -1){
			pos = son[pos];
		}
		printf("%d ", pos);
		vis[pos] = 1;
		cnt ++;
	}
	printf("\n");

	return 0;
}