from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

class DSU:
    def __init__(self, n):
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a, b):
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        x, y = self.leader(a), self.leader(b)
        if x == y: return x
        if -self.parent_or_size[x] < -self.parent_or_size[y]: x, y = y, x
        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x
        return x

    def same(self, a, b):
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        return self.leader(a) == self.leader(b)

    def leader(self, a):
        assert 0 <= a < self._n
        if self.parent_or_size[a] < 0: return a
        self.parent_or_size[a] = self.leader(self.parent_or_size[a])
        return self.parent_or_size[a]

    def size(self, a):
        assert 0 <= a < self._n
        return -self.parent_or_size[self.leader(a)]

    def groups(self):
        leader_buf = [self.leader(i) for i in range(self._n)]
        result = [[] for _ in range(self._n)]
        for i in range(self._n): result[leader_buf[i]].append(i)
        return [r for r in result if r != []]

N,M,Q = map(int,input().split())

AB = [tuple(map(int,input().split())) for _ in range(M)]
CD = [tuple(map(int,input().split())) for _ in range(Q)]

X = set(CD)

D = DSU(N+1)
Y = []
for a,b in AB:
    if (a,b) in X:
        continue
    Y.append((a,b))
    D.merge(a,b)

check = defaultdict(lambda:set())
ok = defaultdict(lambda:Q-1)
ng = defaultdict(lambda:-1)
mid = defaultdict(lambda:(Q-1)//2)

ans = defaultdict(lambda:-2)
F = set()
S = set([i for i in range(2,N+1)])
for i in range(2,N+1):
    if D.same(1,i):
        ans[i]=-1
        F.add(i)
        S.discard(i)
        

for c,d in CD:
    D.merge(c,d)

for i in range(2,N+1):
    if i in F:
        continue
    if not D.same(1,i):
        S.discard(i)
        F.add(i)
        ans[i] = 0
        

for s in S:
    check[(Q-1)//2].add(s)

cnt = 0
n = len(S)

    
while cnt!=n:
    
    D = DSU(N+1)
    for a,b in Y:
        D.merge(a,b)
    
    
    for i in range(Q):
        c,d = CD[-1-i]
        D.merge(c,d)
        for s in check[i]:
            
            if D.same(1,s):
                ok[s] = i
            else:
                ng[s] = i
            
            if ok[s]-ng[s]==1:
                cnt += 1
                continue

            mid[s] = (ok[s]+ng[s])//2
            check[mid[s]].add(s)
        
        check[i] = set()
for s in S:
    
    ans[s] = Q - ok[s]
    
for i in range(2,N+1):
    print(ans[i])