n,m,q=map(int,input().split())

e=[]
d={}
for i in range(m):
  a,b=map(int,input().split())
  a-=1
  b-=1
  e+=[(a,b)]
  d[(a,b)]=i

u=[1]*m
p=[]
for i in range(q):
  a,b=map(int,input().split())
  a-=1
  b-=1
  u[d[(a,b)]]=0
  p+=[d[(a,b)]]

ans=[-1]*n

r=[-1]*n
v=[[i] for i in range(n)]

def root(a):
  while r[a]!=-1:
    a=r[a]
  return a

def union(a,b):
  ra=root(a)
  rb=root(b)
  if ra==rb:
    return
  if len(v[ra])<len(v[rb]):
    ra,rb=rb,ra
  v[ra]+=v[rb]
  r[rb]=ra
  return

for i in range(m):
  if u[i]:
    a,b=e[i]
    union(a,b)

for i in reversed(range(q)):
  a,b=e[p[i]]
  a=root(a)
  b=root(b)
  c=root(0)
  if a==c and b!=c:
    for j in v[b]:
      ans[j]=i+1
  if a!=c and b==c:
    for j in v[a]:
      ans[j]=i+1
  union(a,b)

print(*ans[1:],sep="\n")