#!/usr/bin/env pypy3

import array
import collections


UNDEF = -2
Edge = collections.namedtuple("Edge", "source dest")


class UnionFind(object):

    def __init__(self, number_of_nodes):  # 初期化
        self.par = array.array("L", range(number_of_nodes))
        self.rank = array.array("L", (0 for i in range(number_of_nodes)))

    def root(self, node):  # 根を求める
        if self.par[node] == node:
            return node
        else:
            r = self.root(self.par[node])
            self.par[node] = r  # 経路圧縮
            return r

    def in_the_same_set(self, node1, node2):  # 同じ集合に属するか
        return self.root(node1) == self.root(node2)

    def unite(self, node1, node2):  # 属する集合を併合
        x = self.root(node1)
        y = self.root(node2)
        if x == y:
            pass
        elif self.rank[x] < self.rank[y]:
            self.par[x] = y
        else:
            self.par[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1


def solve(n, q, all_edges, removed_edges):
    rest_edges = set(all_edges) - set(removed_edges)
    uf = UnionFind(n)
    con_time = array.array("l", (UNDEF for _ in range(n)))
    for source, dest in rest_edges:
        uf.unite(source, dest)
    for i in range(1, n):
        if uf.in_the_same_set(0, i):
            con_time[i] = -1
    for t, (source, dest) in enumerate(reversed(removed_edges)):
        uf.unite(source, dest)
        for i in range(1, n):
            if con_time[i] == UNDEF and uf.in_the_same_set(0, i):
                con_time[i] = q - t
    for i in range(1, n):
        if not uf.in_the_same_set(0, i):
            con_time[i] = 0
    return con_time


def main():
    n, m, q = map(int, input().split())
    all_edges = [Edge(*(int(x) - 1 for x in input().split()))
                 for _ in range(m)]
    removed_edges = [Edge(*(int(x) - 1 for x in input().split()))
                     for _ in range(q)]
    ans = solve(n, q, all_edges, removed_edges)
    print(*map(str, ans[1:]), sep="\n")


if __name__ == '__main__':
    main()