from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
from fractions import Fraction
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

n,k,x=MI()
s=list(range(1,n+1))
for _ in range(x-1):
    i,j=MI1()
    s[i],s[j]=s[j],s[i]
SI()
ij=LLI1(k-x)
t=LI()
for i,j in ij[::-1]:
    t[i], t[j] = t[j], t[i]
ans=[]
for i in range(n):
    if s[i]!=t[i]:
        ans.append(i+1)
        if len(ans)==2:break
print(*ans)