#include <iostream>
#include <deque>
#include <algorithm>
using namespace std;
deque<int>s;
int main(){
	int n,k,p;
	cin>>n;
	s.push_front(1);//一号同学入队
	for(int i=2;i<=n;i++){
		cin>>k>>p;
		if(p==0){
			//插左边
			auto it=find(s.begin(),s.end(),k);
			s.insert(it,i);
		}
		if(p==1){
			auto it=find(s.begin(),s.end(),k);
			s.insert(it+1,i);
		}
	}
	int m;
	cin>>m;
	int num;
	while(m--){
		cin>>num;
		auto it2 = find(s.begin(),s.end(),num);
		if(it2!=s.end()){
			s.erase(it2);
		}
		else
		{
			continue;
		}
	}
	for(auto it3=s.begin();it3!=s.end()-1;it3++){
		cout<<*it3<<" ";
	}
	auto it3=s.rbegin();
	cout<<*it3<<endl;
	return 0;
}

用了deque 还能继续优化吗 TLE1.20s 0.2秒感觉还有希望QAQ 萌新刚学OI 求大佬指导一下