import sys
from collections import deque
def dfs(b,h,E,ans,reachable,turn):
	if reachable[h]:
		return
	reachable[h] = True
	ans[h] = turn
	for nxt in E[h]:
		if b == nxt:
			continue
		dfs(h,nxt,E,ans,reachable,turn)
def solve():
	sys.setrecursionlimit(200000)
	N,M,Q = map(int,raw_input().split())
	reachable = [False]*N
	E = [[] for i in xrange(N)]
	ans = [None]*N
	Eset = set()
	BEset = set()
	q = deque()
	for i in xrange(M):
		ft = tuple(map(lambda x: int(x)-1,raw_input().split()))
		Eset.add(ft)
	for i in xrange(Q):
		ft = tuple(map(lambda x: int(x)-1,raw_input().split()))
		BEset.add(ft)
		q.appendleft(ft)
	Eset = Eset - BEset
	for f,t in Eset:
		E[f].append(t)
		E[t].append(f)
	dfs(-1,0,E,ans,reachable,-1)
	for i in xrange(Q):
		f,t = q[i]
		E[f].append(t)
		E[t].append(f)
		if reachable[f] and (not reachable[t]):
			dfs(f,t,E,ans,reachable,Q-i)
		elif reachable[t] and (not reachable[f]):
			dfs(t,f,E,ans,reachable,Q-i)
	for i in xrange(1,N):
		print ans[i]
solve()