n, m, k = map(int, input().split())
A=[]
sum = 0
a = [0 for i in range(m)]
b = [0 for i in range(m)]
c = [0 for i in range(m)] 
d = [0 for i in range(m)]

for i in range(m):
  a[i], b[i], c[i] = map(int, input().split())
  sum += c[i]

for i in range(k):
  e = int(input())
  d[e - 1] = 1

for i in range(m):
  A.append([c[i], a[i] - 1, b[i] - 1, d[i]])

A.sort()
 
from collections import defaultdict
 
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
 
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
 
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
 
        if x == y:
            return
 
        if self.parents[x] > self.parents[y]:
            x, y = y, x
 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
 
    def size(self, x):
        return -self.parents[self.find(x)]
 
    def same(self, x, y):
        return self.find(x) == self.find(y)
 
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
 
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
 
    def group_count(self):
        return len(self.roots())
 
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
 
    def __str__(self):
   	     return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

t = 0

uf = UnionFind(n)

for [c, a, b, d] in A:
  if d == 1:
    t += c
    uf.union(a,b)

for [c, a, b, d] in A:
  if d == 0:
    if not uf.same(a,b):
      t += c
      uf.union(a,b)

print(sum - t)