N, M, K = map(int, input().split())
Root = [n for n in range(N)]
Children = [{n} for n in range(N)]
edges = [None for _ in range(M)]
for m in range(M):
	a, b, c = map(int, input().split())
	edges[m] = (a-1, b-1, c)
abs_edges = set(int(input())-1 for _ in range(K))
sorted_edges = sorted([e for e in set(range(M)) - abs_edges], key=lambda x: edges[x][2])

# 最小木
T = {edges[e] for e in abs_edges}

del_weight = 0

# union tree
for e in abs_edges:
	a, b, _ = edges[e]
	if Root[a] == a and Root[b] == b:
		Children[a] |= Children[Root[b]]
		for c in Children[Root[b]]:
			Root[c] = a
	elif Root[a] == a and Root[b] != b:
		Children[Root[a]] |= Children[Root[b]]	
		for c in Children[Root[b]]:
			Root[c] = Root[a]
	else:
		Children[Root[b]] |= Children[Root[a]]
		for c in Children[Root[a]]:
			Root[c] = Root[b]

is_finish = False

for n in range(N):
	if len(Children[n]) == N:
		is_finish = True

for e in sorted_edges:
	# edge eを追加できるかどうか
	a, b, c = edges[e]
	if is_finish or Root[a] == Root[b]:
		del_weight += c
		continue
	if Root[a] == a and Root[b] == b:
		Children[a] |= Children[Root[b]]
		for c in Children[Root[b]]:
			Root[c] = a
		if len(Children[a]) == N:
			is_finish = True
	elif Root[a] == a and Root[b] != b:
		Children[Root[a]] |= Children[Root[b]]
		for c in Children[Root[b]]:
			Root[c] = Root[a]
		if len(Children[Root[a]]) == N:
			is_finish = True	
	else:
		Children[Root[b]] |= Children[Root[a]]
		for c in Children[Root[a]]:
			Root[c] = Root[b]
		if len(Children[Root[b]]) == N:
			is_finish = True

print(del_weight)