import sys
sys.setrecursionlimit(10 ** 8)

N,M,K = map(int,input().split())
edge = []
for _ in range(M):
    a,b,c = map(int,input().split())
    edge.append((c,a,b,_))
parent = list(range(N + 1))
def find(i):
    if parent[i] == i:
        return i
    parent[i] = find(parent[i])
    return parent[i]
def unite(i,j):
    I = find(i)
    J = find(j)
    if I == J:
        return False
    parent[I] = J
    parent[i] = J
    return True
def isSame(i,j):
    return find(i) == find(j)

ans = 0
s = set()
for _ in range(K):
    e = int(input())
    c,a,b,i = edge[e - 1]
    unite(a,b)
    s.add(e - 1)
edge.sort(key = lambda x:x[0])
for c,a,b,_ in edge:
    if _ in s:continue
    if isSame(a,b):
        ans += c
    else:
        unite(a,b)
print(ans)