import sys
def dfs(h,E,ans,reach,turn):
	q = [[-1,h]]
	while q:
		b,h = q.pop()
		if reach[h]:continue
		reach[h] = True
		ans[h] = turn
		for nxt in E[h]:
			if b == nxt:continue
			q.append([h,nxt])
def solve():
	ofs = 10**6
	N,M,Q = map(int,raw_input().split())
	reach = [False]*N
	EL = [[] for i in xrange(N)]
	ans = [0]*N
	Break = set()
	Edges = map(lambda x: map(lambda x:int(x)-1,x.split()),sys.stdin.readlines())
	for i in xrange(Q):
		Break.add(Edges[M+i][0]+Edges[M+i][1]*ofs)
		Break.add(Edges[M+i][0]*ofs+Edges[M+i][1])
	for i in xrange(M):
		f,t = Edges[i]
		if (f+t*ofs) in Break:
			continue
		EL[f].append(t); EL[t].append(f)
	dfs(0,EL,ans,reach,-1)
	for i in xrange(Q,0,-1):
		f,t = Edges[M+i-1]
		EL[f].append(t); EL[t].append(f)
		if reach[f]:
			dfs(t,EL,ans,reach,i)
		elif reach[t]:
			dfs(f,EL,ans,reach,i)
	for i in xrange(1,N):
		print ans[i]
solve()