#include <iostream>
using namespace std;
const int Nm = 1e5+10;

struct node 
{
    int pn[2];
}Node[Nm];

int main()
{
    int M, N;
    scanf("%d", &N);
    int first = 1;
    for (int i = 2; i <= N; i++) {
        int k, p;    scanf("%d %d", &k, &p);
        Node[Node[k].pn[p]].pn[p ^ 1] = i;
        Node[i].pn[p] = Node[k].pn[p];
        Node[i].pn[p ^ 1] = k;
        Node[k].pn[p] = i;
        if (k == first && p == 0)
            first = i;
    }
    scanf("%d", &M);
    while (M--)
    {
        int x;     scanf("%d", &x);
        Node[Node[x].pn[0]].pn[1] = Node[x].pn[1];
        Node[Node[x].pn[1]].pn[0] = Node[x].pn[0];
        if (x == first) 
            first = Node[x].pn[1]; 
    }
    for (int i = first; i != 0; i = Node[i].pn[1])
        printf("%d ", i);
}