class UnionFind:
    def __init__(self, n):
        self.parent = list(range(n)) #親ノード
        self.size = [1]*n #グループの要素数
 
    def root(self, x): #root(x): xの根ノードを返す．
        while self.parent[x] != x:
            self.parent[x] = self.parent[self.parent[x]]
            x = self.parent[x]
        return x 
 
    def merge(self, x, y): #merge(x,y): xのいる組とyのいる組をまとめる
        x, y = self.root(x), self.root(y)
        if x == y: return False
        if self.size[x] < self.size[y]: x,y=y,x #xの要素数が大きいように
        self.size[x] += self.size[y] #xの要素数を更新
        self.parent[y] = x #yをxにつなぐ
        return True
 
    def issame(self, x, y): #same(x,y): xとyが同じ組ならTrue
        return self.root(x) == self.root(y)
        
    def getsize(self,x): #size(x): xのいるグループの要素数を返す
        return self.size[self.root(x)]

n,m,k = map(int,input().split())
abc = [list(map(int,input().split())) for _ in range(m)]
keep = [0]*m
for _ in range(k):
    keep[int(input())-1] = 1
use = []
UF = UnionFind(n)
for i,(a,b,c) in enumerate(abc):
    if keep[i]:
        UF.merge(a-1,b-1)
    else:
        use.append((c,a-1,b-1))
use.sort(key=lambda x:x[0])
ans = 0
for c,a,b in use:
    if not UF.merge(a,b):
        ans += c
print(ans)