mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.buffer.readline

    class UnionFind():
        def __init__(self, n):
            self.n = n
            self.root = [-1] * (n + 1)
            self.rnk = [0] * (n + 1)

        def find_root(self, x):
            while self.root[x] >= 0:
                x = self.root[x]
            return x

        def unite(self, x, y):
            x = self.find_root(x)
            y = self.find_root(y)
            if x == y:
                return
            elif self.rnk[x] > self.rnk[y]:
                self.root[x] += self.root[y]
                self.root[y] = x
            else:
                self.root[y] += self.root[x]
                self.root[x] = y
                if self.rnk[x] == self.rnk[y]:
                    self.rnk[y] += 1

        def isSameGroup(self, x, y):
            return self.find_root(x) == self.find_root(y)

        def size(self, x):
            return -self.root[self.find_root(x)]

    N, M, K = map(int, input().split())
    E = []
    S = 0
    for _ in range(M):
        a, b, c = map(int, input().split())
        E.append([a, b, c])
        S += c
    P = 0
    for _ in range(K):
        i = int(input()) - 1
        P += E[i][2]
        E[i][2] = 0

    E.sort(key=lambda x: x[2])
    UF = UnionFind(N)
    for a, b, c in E:
        if not UF.isSameGroup(a, b):
            UF.unite(a, b)
            P += c
    print(S - P)


if __name__ == '__main__':
    main()