#include<bits/stdc++.h>
using namespace std;
const int N=100010;
int e[N],l[N],r[N],idx;
int b[N]={0};
void into()
{
l[1] = 0, r[0] = 1;
idx = 2;
}
void add(int k, int x)
{
e[idx] = x;
l[idx] = k;
r[idx] = r[k];
l[r[k]] = idx;
r[k] = idx;
idx++;
}
void move(int k)
{
r[l[k]] = r[k];
l[r[k]] = l[k];
}
int main(){
int n;
cin>>n;
n-=1;
into();
add(l[1],1);
b[0]=1;
int t=2;
memset(b,0,sizeof b);
while(n--){
int k,p;
cin>>k>>p;
if(p==1){
add(k+1,t);
}
else
add(l[k+1],t);
b[t++]=1;
}
int m;
cin>>m;
while(m--){
int y;
cin>>y;
if(b[y]==0) continue;
move(y+1);
b[y]--;
}
int sum=0;
for(int i=r[0];i!=1;i=r[i]){
sum++;
}
for(int i=r[0];i!=1;i=r[i]) {
cout<<e[i];
if(sum!=1){
cout<<" ";
}
sum--;
}
cout<<endl;
return 0;
}