#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

int main(){

	int n, k, x;
	cin >> n >> k >> x;

	vector<int> a1(x-1);
	vector<int> b1(x-1);

	vector<int> a2(k-x);
	vector<int> b2(k-x);
	char q[2];

	for(int i=0; i<x-1; i++) cin >> a1[i] >> b1[i];

	cin >> q[0] >> q[1];

	for(int i=0; i<k-x; i++) cin >> a2[i] >> b2[i];

	vector<int> c(n);
	vector<int> t(n);
	for(int i=0; i<n; i++){
		cin >> c[i];
		t[i] = i+1;
	}

	for(int i=0; i<x-1; i++){
		int tmp;
		tmp = t[ a1[i]-1 ];
		t[ a1[i]-1 ] = t[ b1[i]-1 ];
		t[ b1[i]-1 ] = tmp;
	}

	for(int i=k-x-1; i>=0; i--){
		int tmp;
		tmp = c[ a2[i]-1 ];
		c[ a2[i]-1 ] = c[ b2[i]-1 ];
		c[ b2[i]-1 ] = tmp;
	}
	int ans[2];
	int j=0;
	for(int i=0; i<n; i++){
		if( t[i] != c[i] ){
			ans[j] = i+1;
			j++;
			if( j == 2 ) break;
		}
	}
	if( ans[0] < ans[1] ) cout << ans[0] << " " << ans[1] << endl;
	else cout << ans[1] << " " << ans[0] << endl;

	

	return 0;
}