n, m, q = map(int, raw_input().split())
g = [set() for _ in xrange(n+1)]
for _ in xrange(m):
    a, b = map(int, raw_input().split())
    g[a].add(b)
    g[b].add(a)
e = []
for _ in xrange(q):
    a, b = map(int, raw_input().split())
    g[a].remove(b)
    g[b].remove(a)
    e.append((a,b))
r = [0]*(n+1)
def dfs(i, x):
    s = [i]
    while s:
        j = s.pop()
        if r[j] == 0:
            r[j] = x
            s += g[j]
dfs(1, -1)
for i, j in e[::-1]:
    g[i].add(j)
    g[j].add(i)
    if not r[i]==r[j]==0:
        dfs(i, q)
        dfs(j, q)
    q -= 1
for i in r[2:]:
    print(i)