class UnionFind:
  def __init__(self, n):
    self.node = [-1 for _ in range(n)]

  def root(self, v):
    if self.node[v] < 0:
      return v

    st = []
    while self.node[v] >= 0:
      st.append(v)
      v = self.node[v]

    for u in st:
      self.node[u] = v

    return v

  def size(self, v):
    v = self.root(v)
    return (- self.node[v])

  def same(self, u, v):
    return self.root(u) == self.root(v)

  def unite(self, u, v):
    ru = self.root(u)
    rv = self.root(v)
    if ru == rv:
      return

    du = self.node[ru]
    dv = self.node[rv]
    if du <= dv:
      self.node[rv] = ru
      self.node[ru] += dv
    else:
      self.node[ru] = rv
      self.node[rv] += du

n, m, k = map(int, input().split())
edges = []
for i in range(m):
  a, b, c = map(int, input().split())
  a -= 1
  b -= 1
  edges.append((a, b, c, i))

used = [False for _ in range(m)]
e = [int(input()) - 1 for _ in range(k)]
uf = UnionFind(n)
for ei in e:
  u, v, _, _ = edges[ei]
  uf.unite(u, v)
  used[ei] = True

edges.sort(key=lambda x: x[2])
ans = 0
for i in range(m):
  a, b, c, ei = edges[i]
  if used[ei]:
    continue
  if uf.same(a, b):
    ans += c
  else:
    uf.unite(a, b)

print(ans)