parent = []
rank = []
edges = []

def init(n):
    for i in range(n):
        parent.append(i)
        rank.append(0)

def find(x):
    if parent[x] == x:
        return x
    else:
        parent[x] = find(parent[x])
        return parent[x]
        
def unite(x, y):
    x = find(x)
    y = find(y)
    if rank[x] < rank[y]:
        parent[x] = y
    else:
        parent[y] = x
        if rank[x] == rank[y]:
            rank[x] = rank[x] + 1

def same(x, y):
    return find(x) == find(y)

def kruskal(e):
    edges.sort()
    cost = 0
    for i in range(e):
        if not same(edges[i][1], edges[i][2]):
            unite(edges[i][1], edges[i][2])
            cost = cost + edges[i][0]
    return cost

N,M,K = list(map(int, input().split(' ')))

a = [0 for _ in range(10**5)]
b = [0 for _ in range(10**5)]
c = [0 for _ in range(10**5)]

for i in range(M):
    a[i], b[i], c[i] = list(map(int, input().split(' ')))
    edges.append((c[i], a[i], b[i]))
cost = sum(c)

init(N+1)
for i in range(K):
    e = int(input())
    e = e - 1
    cost = cost - c[e]
    unite(a[e], b[e])

print(cost - kruskal(M))