1
//使用结构体数组模拟链表，节省查找时间，实在是高
2
//注意初始化中需要一个虚拟0位置作为全链条最左侧或最右侧
3
#include <bits/stdc++.h>
4
using namespace std;
5
typedef long long ll;
6
const ll MAXN=1e5+5;
7
struct node{
8
    ll l,r;
9
    ll d;
10
}m[MAXN];
11
void solve(){
12
    ll n;
13
    cin>>n;
14
    m[1].d=1;
15
    m[1].l=0,m[1].r=0;
16
    m[0].d=0;
17
    m[0].l=0,m[0].r=1;
18
    for(ll i=2;i<=n;i++){
19
        ll k,p;
20
        cin>>k>>p;
21
        if(p==0){
22
            m[i].r=k;
23
            m[i].l=m[k].l;
24
            m[m[k].l].r=i;
25
            m[k].l=i;
26
        }else{
27
            m[i].l=k;
28
            m[i].r=m[k].r;
29
            m[m[k].r].l=i;
30
            m[k].r=i;
31
        }
32
        m[i].d=1;
33
    }
34
    ll nn;
35
    cin>>nn;
36
    for(ll i=0;i<nn;i++){
37
        ll x;
38
        cin>>x;
39
        m[x].d=0;
40
    }
41
    ll now=m[0].r;
42
    while(now!=0){
43
        if(m[now].d){
44
            if(now!=m[0].r)cout<<" ";
45
            cout<<now;
46
        }
47
        now=m[now].r;
48
    }
49
    cout<<endl;
50
}
51
int main(){
52
    solve();
53
    return 0;
54
}