n,m,k = map(int,input().split())
a = []
for i in range(m):
  x,y,z = map(int,input().split())
  a.append([x-1,y-1,z])
c = [int(input())for i in range(k)]
class UnionFind():
    def __init__(self,size):
        self.table = [-1 for _  in range(size)]

    def find(self,x):
        while self.table[x] >= 0:
            x = self.table[x]
        return x

    def union(self,x,y):
        s1 = self.find(x)
        s2 = self.find(y)
        if s1 != s2:
            if self.table[s1] != self.table[s2]:
                if self.table[s1] < self.table[s2]:
                    self.table[s2] = s1
                else:
                    self.table[s1] = s2
            else:
                self.table[s1] += -1
                self.table[s2] = s1
        return
gra = []
uc = 0
ans = 0
for i in range(m):
  ans += a[i][2]
hissu = []
uni = UnionFind(n)
for i in c:
  hissu.append(a[i-1])
for i in range(k):
  hen = hissu[i]
  if (uni.find(hen[0]) != uni.find(hen[1])):
    uc += 1
  ans -= hen[2]
  uni.union(hen[0],hen[1])
for i in range(m):
  gra.append(a[i])
gra = sorted(gra, key = lambda x: x[2])
for i in range(len(gra)):
  hen = gra[i]
  if (uni.find(hen[0]) != uni.find(hen[1])):
    ans -= hen[2]
    uni.union(hen[0],hen[1])
    uc += 1
  if uc == n-1:
    break
print(ans)