import heapq
N,M,K=map(int,input().split())

L=[[]for i in range(N+1)]
l=[[]]
C=[1 for i in range(N+1)]

for i in range(M):
    a,b,c=map(int,input().split())
    L[a].append((b,c))
    L[b].append((a,c))
    l.append([a,b,c])
z=[]
if K>0:
    for i in range(K):
        n=int(input())
        z.append(n)
else:
    x=0
    Z=10**9
    for i in range(1,M+1):
        if l[i][2]<Z:
            Z=l[i][2]
            x=i
    z.append(x)
    #print(l[x][0])

Q=[]
cost=0
for i in z:
    cost+=l[i][2]
    for k in range(2):
        if C[l[i][k]]==1:
            C[l[i][k]]=0
            for j in L[l[i][k]]:
                if C[j[0]]==1:
                    Q.append((j[1],j[0]))
#print(Q)
heapq.heapify(Q)

for i in range(10**6):
    if len(Q)==0:
        break
    else:
        if C[Q[0][1]]==1:
            x,y=Q[0]
            heapq.heappop(Q)
            C[y]=0
            cost+=x
            for j in L[y]:
                if C[j[0]]==1:
                    heapq.heappush(Q,(j[1],j[0]))
        else:
            heapq.heappop(Q)
#print(cost)
#print(len(l))
#print(l)
COST=0
for i in range(1,M+1):
    COST+=l[i][2]
print(COST-cost)