N, M, Q = gets.split.map(&:to_i)
E = Hash.new { |h, k| h[k] = Hash.new(false) }
C = M.times.map { gets.split.map(&:to_i) }
D = Q.times.map { gets.split.map(&:to_i) }

C.each do |a, b|
  E[a][b] = E[b][a] = true
end

D.each do |a, b|
  E[a][b] = E[b][a] = false
end

V = Array.new(N + 1, nil)

def bfs(root, t)
  queue = []
  queue << root

  until queue.empty?
    v = queue.shift

    next if V[v]
    V[v] = t

    E[v].each do |u, s|
      next if not s

      queue << u
    end
  end
end

bfs(1, 0)

D.reverse_each.with_index(1) do |(a, b), t|
  E[a][b] = E[b][a] = true

  if V[a] && V[b].nil?
    bfs(b, t)
  end

  if V[b] && V[a].nil?
    bfs(a, t)
  end
end

puts (2..N).map { |x| t = Q - (V[x] || Q + 1) + 1; t == Q + 1 ? -1 : t }