#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>
#include<random>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, K, X;
    cin >> N >> K >> X;
    vi perm(N);
    for (int i = 0; i < N; i++) {
        perm[i] = i+1;
    }
    for (int i = 0; i < X-1; i++) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        swap(perm[a], perm[b]);
    }
    {
        char c, d;
        cin >> c >> d;
    }
    vi A(K-X), B(K-X);
    for (int i = 0; i < K-X; i++) {
        cin >> A[i] >> B[i];
    }
    reverse(A.begin(), A.end());
    reverse(B.begin(), B.end());
    vi C(N);
    for (int i = 0; i < N; i++)
        cin >> C[i];
    for (int i = 0; i < K-X; i++) {
        swap(C[A[i]-1], C[B[i]-1]);
    }
    vi ans;
    for (int i = 0; i < N; i++) {
        if (perm[i] != C[i]) ans.push_back(i+1);
    }
    cout << ans[0] << " " << ans[1] << endl;
    return 0;
}