#include <bits/stdc++.h>
using namespace std;
const int N=4e5+10; 
int n,w,d,idx[N],nxt[N],head[N],dis[N],tot=0,vis[N],a[N],b[N];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;
set<pair<int,int>> s; 
inline void read(int &x)
{
	int cnt=0;
	char c=getchar();
	while (!('0'<=c && c<='9')) c=getchar();
	while ('0'<=c && c<='9') cnt=cnt*10+(c-'0'),c=getchar();
	x=cnt;
}
inline void add(int x,int y)
{
	idx[++tot]=y;
	nxt[tot]=head[x];
	head[x]=tot;
} 
void dijkstra()
{
	memset(dis,0x3f,sizeof(dis)); 
	dis[n]=0;
	q.push({0,n});
	while (!q.empty())
	{
		int t=q.top().second;q.pop();
		if (vis[t]) continue;
		vis[t]=1;
//		cout<<t<<endl
		for (int i=head[t];i;i=nxt[i])
		{
			int y=idx[i]; 
			if (dis[y]>dis[t]+1)
			{
				dis[y]=dis[t]+1;
				if (!vis[y]) q.push({dis[y],y});
			}
		}
	}
}
int main() {
	freopen("Commute.in","r",stdin);
	freopen("Commute.out","w",stdout); 
	read(n),read(w),read(d);
	while (w--)
	{
		int x,y;
		read(x),read(y);
		add(y,x);
	} 
	dijkstra();
	for (int i=1;i<=n;i++) read(a[i]),s.insert({dis[a[i]]+i-1,a[i]}),b[a[i]]=i-1;
	while (d--)
	{
		int x,y;
		read(x),read(y); 
		s.erase({b[a[x]]+dis[a[x]],a[x]});
		s.erase({b[a[y]]+dis[a[y]],a[y]});
		add(x,y);
		b[a[x]]=y-1,b[a[y]]=x-1;
		swap(a[x],a[y]);
		s.insert({b[a[x]]+dis[a[x]],a[x]}),s.insert({b[a[y]]+dis[a[y]],a[y]});	
		printf("%d\n",(*(s.begin())).first);
	}
}