from collections import defaultdict

class UnionFind():
    def __init__(self, n):
        '''
        UnionFindクラス。nは要素数を表す。
        '''
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        '''
        要素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を含む集合と要素yを含む集合を合体する関数。
        基本的には、要素数が多い集合に統合される。
        要素数が同じときは要素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):
        '''
        要素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):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

n, m, q = map(int, input().split())
L = set()
for _ in range(m):
    u, v = map(int, input().split())
    L.add((u - 1, v - 1))
Q = []
for _ in range(q):
    u, v = map(int, input().split())
    L.remove((u - 1, v - 1))
    Q.append((u - 1, v - 1))
UF = UnionFind(n)
M = [set([i]) for i in range(n)]
root_1 = 0
for u, v in L:
    if UF.same(u, v):
        continue
    uroot = UF.find(u)
    vroot = UF.find(v)
    UF.union(u, v)
    root = UF.find(u)
    if root == uroot:
        M[root] |= M[vroot]
        M[vroot] = set()
    else:
        M[root] |= M[uroot]
        M[uroot] = set()
    if 0 in M[root]:
        root_1 = root
ANS = [0 for _ in range(n)]
for u in M[root_1]:
    ANS[u] = -1
for i in range(q - 1, -1, -1):
    u, v = Q[i]
    if UF.same(u, v):
        continue
    uroot = UF.find(u)
    vroot = UF.find(v)
    if 0 in M[uroot]:
        for j in M[vroot]:
            ANS[j] = i + 1
    elif 0 in M[vroot]:
        for j in M[uroot]:
            ANS[j] = i + 1
    UF.union(u, v)
    root = UF.find(u)
    if root == uroot:
        M[root] |= M[vroot]
        M[vroot] = set()
    else:
        M[root] |= M[uroot]
        M[uroot] = set()
print(*ANS[1:], sep='\n')