n,m,q = gets.split.map(&:to_i)
F = (n + 1).times.map{|i| i }
G = Array.new(n + 1){ [] }
E = []
H = {}
ans = Array.new(n + 1)

def root(a)
    if F[a] == a
        a
    else
        F[a] = root(F[a])
    end
end
def union(*ab)
    a,*b = ab.map{|i| root(i)}.sort
    b.each do |i|
        F[i] = a
    end
end
def same?(a,b)
    root(a) == root(b)
end
def bfs(s, ev, used)
    q = []
    q << s
    until q.empty?
        v = q.shift
        used[v] ||= ev 
        G[v].each do |to|
            q << to if !used[to]
        end
    end
end


m.times do |i|
    k = gets.chomp
    e = E.size
    a,b = k.split.map(&:to_i)
    E << [a, b, 2 * q]
    H[k] = e
end
(1 .. q).each do |t|
    k = gets.chomp
    e = H[k]
    E[e][2] = t
end

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