def aa(m):
    c=[]
    while m!=uf[m]:
        c.append(m);m=uf[m]
    for i in c:
        uf[i]=m
    return m

def bb(a,b,k):
    a,b=aa(a),aa(b);c=aa(0)
    if a==b:
    	return 
    if c==a or b==c:
        for i in list(y[a]):
            ans[i]=k
        for i in list(y[b]):
            ans[i]=k
        y[a]=set();y[b]=set();uf[a]=b
        return 
    if len(y[a])<len(y[b]):
        a,b=b,a
    for i in list(y[b]):
        y[a].add(i)
    uf[b]=a
    

n,m,q=map(int,input().split())
s=set([tuple(map(int,input().split())) for i in range(m)])
x=[];ans=[0]*n
for i in range(q):
    a,b=map(int,input().split())
    s.discard((a,b))
    x.append((a,b))
uf=[i for i in range(n)]
y=[set([i]) for i in range(n)]
while s:
    a,b=s.pop()
    a-=1;b-=1
    bb(a,b,-1)
for i in range(q-1,-1,-1):
    bb(x[i][0]-1,x[i][1]-1,i+1)
for i in ans[1:]:
    print(i)