import heapq


class UnionFind:
    def __init__(self, size):
        self.parent = [-1] * size

    def union(self, x, y):
        x, y = self.root(x), self.root(y)
        if x == y:
            return False
        if self.parent[x] > self.parent[y]:
            x, y = y, x
        self.parent[x] += self.parent[y]
        self.parent[y] = x
        return True

    def root(self, x):
        if self.parent[x] < 0:
            return x
        self.parent[x] = self.root(self.parent[x])
        return self.parent[x]


N, M, K = map(int, input().split())
graph = [[] for _ in range(N)]
edges = []
uf = UnionFind(N)

for i in range(M):
    u, v, w = map(int, input().split())
    u -= 1
    v -= 1
    graph[u].append((v, w))
    graph[v].append((u, w))
    edges.append((u, v, w, i))

used = set()
for _ in range(K):
    e = int(input()) - 1
    u, v, w, _ = edges[e]
    uf.union(u, v)
    used.add(e)

edges.sort(key=lambda x: x[2])
erased = 0
for u, v, w, i in edges:
    if i in used:
        continue
    if not uf.union(u, v):
        erased += w

print(erased)