# Here your code !
n,m,q = gets.split.map(&:to_i)
F = (n + 1).times.map{|i| i }
def root(a)
    if F[a] == a
        a
    else
        F[a] = root(F[a])
    end
end
def union(a,b)
    F[root(b)] = root(a)
end
def same?(a,b)
    root(a) == root(b)
end

ans = Array.new(n + 1)
E = []
H = {}
m.times do |i|
    k = gets.chomp
    e = E.size
    a,b = k.split.map(&:to_i)
    E << [a, b, -1]
    H[k] = e
end
(1 .. q).each do |i|
    k = gets.chomp
    e = H[k]
    E[e][2] = i
end

E.sort_by! {|(from, to, ev)| ev < 0 ? ev : q - ev }
E.each do |(from, to, ev)|
    union(from,to)
    (2 .. n).each do |i|
        if same?(1, i)
            ans[i] ||= ev
        end
    end
end
(2 .. n).each do |i|
    ans[i] ||= 0
end
puts ans[2 .. n]