import sys
def dfs(b,h,E,ans,reachable,turn):
	if reachable[h]:
		return
	reachable[h] = 1
	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 = [0]*N
	EL = [[] for i in xrange(N)]
	ans = [0]*N
	BEset = [set() for i in xrange(N)]
	BE = []
	Edge = [map(lambda x: int(x)-1,raw_input().split()) for i in xrange(M)]
	BE = [map(lambda x: int(x)-1,raw_input().split()) for i in xrange(Q)]
	for i in xrange(Q):
		BEset[BE[i][0]].add(BE[i][1])
	for f,t in Edge:
		if t in BEset[f] or f in BEset[t]:
			continue
		EL[f].append(t)
		EL[t].append(f)
	dfs(-1,0,EL,ans,reachable,-1)
	for i in xrange(Q-1,-1,-1):
		f,t = BE[i]
		EL[f].append(t)
		EL[t].append(f)
		if reachable[f]:
			dfs(f,t,EL,ans,reachable,i+1)
		elif reachable[t]:
			dfs(t,f,EL,ans,reachable,i+1)
	for i in xrange(1,N):
		print ans[i]*reachable[i]
solve()