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

    def find(self, x):
        """ 根を見つける関数を定義(同時にxを直接根にくっつける操作も行う)"""
        tmp = []
        parents = self.parents
        while parents[x] >= 0:
            tmp.append(x)
            x = parents[x]
        for y in tmp:
            parents[y] = x
        return 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 same(self, x, y):
        """ xとyが同じ根の子かを判定 """
        return self.find(x) == self.find(y)

    def size(self, x):
        """ xの根のparent(= 要素数)を返す """
        return -self.parents[self.find(x)]

    def members(self, x):
        """ xが属するグループの要素をリストとして返す O(N)"""
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        """ 全ての根の要素をリストとして返す O(N)"""
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        """ グループの数を返す O(N)"""
        return len(self.roots())

    def size_list(self):
        """ 各グループの要素数のリストを返す(根の番号は返さない) O(N)"""
        return [-x for x in self.parents if x < 0]

    def all_group_members(self):
        """ {根:[根の子(根を含む)のリスト],...}を辞書で返す O(N)"""
        res = [[] for _ in range(self.n)]
        for i in range(self.n):
            x = self.find(i)
            res[x].append(i)
        return {r: res[r] for r in self.roots()}

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

##############################################################################################################
import sys
input = sys.stdin.readline


N, M, Q = map(int, input().split())
U = UnionFind(N)
data=set()
for _ in range(M):
    a, b = map(int, input().split())
    a, b = a-1, b-1
    if a<b: a,b=b,a
    data.add((a, b))

data2=[]
for _ in range(Q):
    a, b = map(int, input().split())
    a, b = a-1, b-1
    if a<b: a,b=b,a
    data2.append((a, b))
    data.remove((a,b))

data2.reverse()

for a,b in data:
    U.union(a,b)

memo=U.all_group_members()

res=[0]*N

for i in memo[U.find(0)]:
    res[i]=-1

joint=dict()
time=Q
for a,b in data2:
    a0,b0=U.same(a,0),U.same(b,0)
    if a0==True and b0==False:
        res[U.find(b)]=time
    elif b0==True and a0==False:
        res[U.find(a)]=time
    elif a0==b0==False:
        x = U.find(a)
        y = U.find(b)
        if U.parents[x] > U.parents[y]:
            x, y = y, x
        joint[y]=x
    U.union(a,b)
    time-=1



for key,val in memo.items():
    P=[key]
    while key in joint:
        key=joint[key]
        P.append(key)
    root=res[key]
    for p in P:
        for i in memo[p]:
            res[i]=root
        if p in joint:
            del joint[p]

print(*res[1:], sep="\n")