N,M,K = map(int,input().split())
src = [tuple(map(int,input().split())) for i in range(M)]
required = [0]*M
for i in range(K):
    e = int(input()) - 1
    required[e] = 1

class UnionFind:
    def __init__(self,N):
        self.parent = [i for i in range(N)]
        self.rank = [0] * N
        self.count = 0
    def root(self,a):
        if self.parent[a] == a:
            return a
        else:
            self.parent[a] = self.root(self.parent[a])
            return self.parent[a]
    def is_same(self,a,b):
        return self.root(a) == self.root(b)
    def unite(self,a,b):
        ra = self.root(a)
        rb = self.root(b)
        if ra == rb: return
        if self.rank[ra] < self.rank[rb]:
            self.parent[ra] = rb
        else:
            self.parent[rb] = ra
            if self.rank[ra] == self.rank[rb]: self.rank[ra] += 1
        self.count += 1

uf = UnionFind(N)
for i in range(M):
    if not required[i]: continue
    a,b,c = src[i]
    uf.unite(a-1, b-1)

total_cost = 0
es = []
for i in range(M):
    if required[i]: continue
    a,b,c = src[i]
    total_cost += c
    es.append((c,i))
es.sort()

need_cost = 0
ei = 0
while uf.count < N-1:
    c,i = es[ei]
    a,b,c = src[i]
    if not uf.is_same(a-1, b-1):
        uf.unite(a-1, b-1)
        need_cost += c
    ei += 1
print(total_cost - need_cost)