#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr;	} cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define all(x) (x).begin(), (x).end()



typedef pair<int, int> pii;

const int dx[] = { 1, 0, -1, 0 };
const int dy[] = { 0, -1, 0, 1 };

int yuki0429()
{
	int N, K, X;
	cin >> N >> K >> X;

	vector<int> s(N + 1, 0), g(N + 1, 0);

	for (int i = 1; i <= N; i++) s[i] = i;

	stack<pii> st;

	int A, B;
	for (int i = 1; i <= X - 1; i++) {
		cin >> A >> B;
		swap(s[A], s[B]);
	}

	char d;
	cin >> d >> d;

	for (int i = X + 1; i <= K; i++) {
		cin >> A >> B;
		st.push(pii(A, B));
	}

	int C;
	for (int i = 1; i <= N; i++) {
		cin >> C; 
		g[i] = C;
	}

	while (!st.empty()) {
		A = st.top().first;
		B = st.top().second;
		swap(g[A], g[B]);
		st.pop();
	}

	vector<int> ans;
	for (int i = 1; i <= N; i++) {
		if (s[i] != g[i]) ans.push_back(i);
	}

	if (ans[0] > ans[1]) swap(ans[0], ans[1]);

	cout << ans[0] << " " << ans[1] << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0429();
	
	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}