// Problem: A. t1
// Contest: undefined - NOIP2024训练赛 04
// URL: http://noi.ac/contest/1156/problem/582
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// Challenger: Erica N
// ----
// 
#include<bits/stdc++.h>

using namespace std;
#define rd read()
#define ull unsigned long long
#define int long long 
#define pb push_back
#define itn int
#define ps second 
#define pf first


#define rd read()
int read(){
  int xx = 0, ff = 1;char ch = getchar();
  while (ch < '0' || ch > '9'){
    if (ch == '-')ff = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
  return xx * ff;
}
#define zerol = 1
#ifdef zerol
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() {cerr << endl;}
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) {
	for (auto v: a) cerr << v << ' ';err(x...);
}
template<typename T, typename... A>
void err(T a, A... x) {
	cerr << a << ' ';err(x...);
}
#else
#define dbg(...)
#endif
const int N=2e5+5;
const ull P=137;
const int INF=1e18+7;
/*

策略


*/	



#define pii pair<int,int>
int faa[N];
vector<int> e[N];
int n;
priority_queue<pii> pq;
int dfn[N],_dfn[N],rdfn[N];
int w[N];
int tim;

void add(int a,int b){
	e[a].pb(b);
}

namespace SGT{
	
	pair<int,int> t[N<<2];
	
	void pushup(int x){
		t[x]=t[x<<1].pf<t[x<<1|1].pf?t[x<<1]:t[x<<1|1];
	}
	void build(itn x,int l,int r){
		if(l==r){
			t[x]={w[_dfn[l]],_dfn[l]};
			return ;
		}
		int mid=l+r>>1;
		build(x<<1,l,mid);
		build(x<<1|1,mid+1,r);
		pushup(x);
	}
	
	pii query(int x,int l,int r,int pl,int pr){
		if(pr<pl)return make_pair(INF,0);
		if(pl<=l&&pr>=r){
			return t[x];
		}
		int mid=l+r>>1;
		pii res={INF,0};
		pii t;
		if(pl<=mid)t=query(x<<1,l,mid,pl,pr),res=t.pf<res.pf?t:res;
		if(pr>mid)t=query(x<<1|1,mid+1,r,pl,pr),res=t.pf<res.pf?t:res;
		return res;
	}
	
	void change(int x,int l,int r,int p){
		if(l==r){
			t[x]={INF,0};
			return ;
		}
		int mid=l+r>>1;
		if(p<=mid)change(x<<1,l,mid,p);
		else change(x<<1|1,mid+1,r,p);
		pushup(x);
	}
}using namespace SGT;



void dfs(int x,int fa){
	dfn[x]=++tim;
	_dfn[tim]=x;
	for(auto v:e[x]){
		if(v==fa)continue;
		dfs(v,x);
	}
	
	rdfn[x]=tim;
}


int cnt;
void dfs2(int x){
	while(1){
		int v=query(1,1,n,dfn[x]+1,rdfn[x]).ps;
		cnt++;
		if(v==0){
			cout<<x<<' ';
			change(1,1,n,dfn[x]);
			return ;
		}
		dfs2(v);
	}
	dfs2(faa[x]);
}


signed main(){
	 n=rd;
	for(int i=2;i<=n;i++){
		faa[i]=rd;
		add(faa[i],i);
	}
	
	
	for(int i=1;i<=n;i++){
		w[i]=rd;
	}
	
	dfs(1,0);
	
	
	build(1,1,n);
	
	dfs2(1);
	
	// cdbg(cnt);
	
	
}