n, m, k = gets.split.map(&:to_i)

Edge = Struct.new("Edge", :u, :v, :cost)
edges = []
m.times do
  a, b, c = gets.split.map(&:to_i)
  edges.push(Edge.new(a - 1, b - 1, c))
end

class UnionFind
  def initialize(n)
    @par = (0...n).to_a
  end

  def find(i)
    @par[i] == i ? @par[i] : @par[i] = find(@par[i])
  end

  def unite(i, j)
    @par[find(i)] = find(j)
  end

  def same(i, j)
    find(i) == find(j)
  end
end

sum = 0
uf = UnionFind.new(n)
k.times do
  i = gets.chomp.to_i
  i -= 1
  uf.unite(edges[i].u, edges[i].v)
  sum += edges[i].cost
end
edges.sort { |a, b| a.cost <=> b.cost }.each do |e|
  unless uf.same(e.u, e.v)
    uf.unite(e.u, e.v)
    sum += e.cost
  end
end

puts edges.reduce(0) { |r, e| r + e.cost } - sum