class UnionFind
  def initialize(n)
    @size = Array.new(n, 1)
    @rank = Array.new(n, 0)
    @parent = []

    (0..n).each do |i|
      @parent[i] = i
    end
  end

  def find(x)
    if @parent[x] == x
      x
    else
      @parent[x] = find(@parent[x])
    end
  end

  def unite(x, y)
    x = find(x)
    y = find(y)
    return if x == y

    if @rank[x] < @rank[y]
      @parent[x] = y
      @size[y] += @size[x]
    else
      @parent[y] = x
      @size[x] += @size[y]

      @rank[x] += 1 if @rank[x] == @rank[y]
    end
  end

  def same?(x, y)
    find(x) == find(y)
  end

  def size(x)
    @size[find(x)]
  end
end

N, M, K = gets.split.map(&:to_i)
E = []

M.times do |i|
  a, b, c = gets.split.map(&:to_i)

  E << [a, b, c, 0]
end

uf = UnionFind.new(N + 1)

K.times do
  e = gets.to_i
  E[e - 1][-1] = -1
end

E.sort_by! { |a, b, c, d| [d, c] }
sum = E.map { |e| e[-2] }.sum
ans = 0

E.each do |a, b, c, d|
  if d == -1
    uf.unite(a, b)
    ans += c
  elsif !uf.same?(a, b)
    uf.unite(a, b)
    ans += c
  end
end

puts sum - ans