#int(input())
#map(int, input().split())
#list(map(int, input().split()))

import sys
sys.setrecursionlimit(200000)

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

N, M, Q = map(int, input().split())
A = [0] * M
for i in range(M):
    a, b = map(int, input().split())
    A[i] = (a-1, b-1)

C = [0] * Q
for i in range(Q):
    a, b = map(int, input().split())
    C[i] = (a-1, b-1)

u = UnionFind(N)

to = [[] for i in range(N)]
# print(C)
sc = set(C)
# print(sc)
for i in range(M):
    if A[i] not in sc:
        a, b = A[i]
        to[a].append(b)
        to[b].append(a)
        u.union(a, b)

ans = [0] * N
r = u.members(0)
for x in r:
    ans[x] = -1
v = [0] * N

for i in range(Q-1, -1, -1):
    # print(i, u.members(0), to, v)
    a, b = C[i]
    f = 0
    if u.same(0, a):
        f += 1
    if u.same(0, b):
        f += 2

    if f == 1 or f == 2:
        if f == 1:
            a, b = b, a
        v[a] = 1
        ans[a] = i+1
        q = [a]
        while q:
            t = q.pop()
            for x in to[t]:
                if v[x] == 0:
                    q.append(x)
                    v[x] = 1
                    ans[x] = i+1

    u.union(a, b)
    to[a].append(b)
    to[b].append(a)

for x in ans[1:]:
    print(x)