import sys
input = sys.stdin.readline

def Find(x, par):
  if par[x] < 0:
    return x
  else:
    # 経路圧縮
    par[x] = Find(par[x], par)
    return par[x]

def Unite(x, y, par, rank):
  x = Find(x, par)
  y = Find(y, par)

  if x != y:
    # rankの低い方を高い方につなげる
    if rank[x] < rank[y]:
      par[y] += par[x]
      par[x] = y
    else:
      par[x] += par[y]
      par[y] = x
      if rank[x] == rank[y]:
        rank[x] += 1

def Same(x, y, par):
  return Find(x, par) == Find(y, par)

def Size(x, par):
  return -par[Find(x, par)]


n, m, q = map(int, input().split())
AB = []
for i in range(m):
    a, b = map(int, input().split())
    a, b = a-1, b-1
    AB.append((a, b))

CD = []
for i in range(q):
    c, d = map(int, input().split())
    c, d = c-1, d-1
    CD.append((c, d))

S = set(CD)

par = [-1]*n
rank = [0]*n

g = [[] for _ in range(n)]

for i in range(m):
    if AB[i] not in S:
        a, b = AB[i]
        Unite(a, b, par, rank)
        g[a].append(b)
        g[b].append(a)

ans = [0]*n
def dfs(v, p):
    s = [v]
    ans[v] = p
    while s:
        v = s.pop()
        for u in g[v]:
            if ans[u] == 0:
                ans[u] = ans[v]
                s.append(u)

dfs(0, -1)

CD.reverse()
for i in range(q):
    c, d = CD[i]
    if Same(0, c, par) and Same(0, d, par):
        Unite(c, d, par, rank)
    elif  Same(0, c, par) and not Same(0, d, par):
        dfs(d, q-i)
        Unite(c, d, par, rank)
    elif  not Same(0, c, par) and Same(0, d, par):
        dfs(c, q-i)
        Unite(c, d, par, rank)
    else:
        Unite(c, d, par, rank)
        g[c].append(d)
        g[d].append(c)

#for i in range(n):
    #if not Same(0, i, par):
        #ans[i] = 0

for i in range(1, n):
    print(ans[i])