// yukicoder: No.748 yuki国のお財布事情
// bal4u 2019.8.19

#include <stdio.h>
#include <stdlib.h>

typedef long long ll;

//// 入出力関係
#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif

int in() { // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

#define MAX 100005

/* UNION-FIND library */
int id[MAX], size[MAX];
void init(int n) { int i; for (i = 0; i < n; i++) id[i] = i, size[i] = 1; }
int root(int i) { while (i != id[i]) id[i] = id[id[i]], i = id[i]; return i; }
int connected(int p, int q) { return root(p) == root(q); }
void unite(int p, int q) {
    int i = root(p), j = root(q); if (i == j) return;
    if (size[i] < size[j]) id[i] = j, size[j] += size[i]; else id[j] = i, size[i] += size[j];
}

typedef struct { int a, b, c; } EDGE; // 道路の両端町、維持費
EDGE edge[MAX]; int sz;
int a[MAX], b[MAX], c[MAX]; char f[MAX];

int cmp(const void *u, const void *v) { return ((EDGE *)u)->c - ((EDGE *)v)->c; }

ll kruskal(int E) {
	int i; ll ans = 0;

	qsort(edge, E, sizeof(EDGE), cmp);
	for (i = 0; i < E; i++) {
		if (!connected(edge[i].a, edge[i].b)) { 
			unite(edge[i].a, edge[i].b);
			ans += edge[i].c;
		}
	}
	return ans;
}

int main()
{
	int i, N, M, K; ll cost, iden;

	N = in(), M = in(), K = in();
	cost = 0; for (i = 1; i <= M; i++) {
		a[i] = in(), b[i] = in(), c[i] = in();
		cost += c[i];
	}
	while (K--) f[in()] = 1;

	init(N+1);  // UNION-FIND 初期化
	iden = 0, sz = 0;
	for (i = 1; i <= M; i++) {
		if (f[i]) {
			iden += c[i];
			unite(a[i], b[i]);
		} else edge[sz].a = a[i], edge[sz].b = b[i], edge[sz++].c = c[i];
	}
	printf("%lld\n", cost-iden-kruskal(sz));
	return 0;
}