class UnionFind:
    def __init__(self, n):
        self.par = [-1]*n
        self.rank = [0]*n

    def Find(self, x):
        if self.par[x] < 0:
            return x
        else:
            self.par[x] = self.Find(self.par[x])
            return self.par[x]

    def Unite(self, x, y):
        x = self.Find(x)
        y = self.Find(y)

        if x != y:
            if self.rank[x] < self.rank[y]:
                self.par[y] += self.par[x]
                self.par[x] = y
            else:
                self.par[x] += self.par[y]
                self.par[y] = x
                if self.rank[x] == self.rank[y]:
                    self.rank[x] += 1

    def Same(self, x, y):
        return self.Find(x) == self.Find(y)

    def Size(self, x):
        return -self.par[self.Find(x)]

import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

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

E = [int(input())-1 for i in range(k)]
E = set(E)
edge = []
uf = UnionFind(n)
ans = 0
for i, (a, b, c) in enumerate(temp):
    if i in E:
        uf.Unite(a, b)
        ans += c
    else:
        edge.append((c, a, b))
edge.sort()
for c, a, b in edge:
    if uf.Same(a, b):
        continue
    uf.Unite(a, b)
    ans += c
print(total-ans)