#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstdio>
using namespace std;
int main(){
int n, m, k;
while (scanf("%d %d %d", &n, &m, &k)!=EOF){
vector<bool> hole(n + 1, false);
for (int i = 0; i < m; i++){
int t;
scanf("%d", &t);
hole[t] = true;
}
int position = 1;
bool flag = false;
if (hole[position]) flag = true;
for (int i = 0; i < k; i++){
int a, b;
scanf("%d %d", &a, &b);
if (flag) continue;
if (a == position || b == position){
position = a + b - position;
}
if (hole[position]) flag = true;
}
printf("%d\n", position);
}
return 0;
}