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

//left和right分别指向左右侧同学的下标。如果是-1则不存在
struct node
{
	int left, right;
} x[N];

int main()
{
	int n, m, k, p, d;
	cin >> n;

	//第一个同学进入队列
	//x[0]作为头结点
	x[0].right = 1;
	x[1].left = 0;
	x[1].right = -1;

	for (int i = 2; i <= n; i++)
	{
		cin >> k >> p;//0左边，1右边

		x[i].left = -1;
		x[i].right = -1;
		if (p == 0) //在左边插入
		{
			x[x[k].left].right = i;
			x[i].left = x[k].left;
			x[i].right = k;
			x[k].left = i;

		}
		else if (p == 1) //在右边插入
		{
			x[i].right = x[k].right;
			x[x[k].right].left = i;
			x[k].right = i;
			x[i].left = k;
		}

	}

	/*
		int j = x[0].right;
		while (j != -1)
		{
			//cout << "(" << x[j].left << "," << j << "," << x[j].right << ') ';
			cout << x[j].left << ':' << j << ":" << x[j].right << endl;

			j = x[j].right;
		}

		cout << "-----------------------\n";
	*/

	cin >> m;
	for (int i = 0; i < m; i++)
	{
		cin >> d;

		if (x[d].left == -1 && x[d].right == -1)
			continue;

		x[x[d].left].right = x[d].right;
		x[x[d].right].left = x[d].left;
		x[d].left = -1;
		x[d].right = -1;
	}


	bool isfirst = true;
	int j = x[0].right;
	while (j != -1)
	{
		if (isfirst)
		{
			isfirst = false;
			cout << j;
		}
		else
			cout << ' ' << j;
		j = x[j].right;
	}
	cout << endl;
	return 0;
}