#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
using Pair = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T> >;
const int inf = 2000000000;


VV<int> dijkstra(int n, VV<int>& edge, V<int>& R, VV<Pair>& route) {
	VV<int> dist(n, V<int>(0));
	V<int> st = { 0,n - 1 };
	rep(i, 0, R.size()) {
		st.push_back(edge[R[i]][0]);
		st.push_back(edge[R[i]][1]);
	}
	rep(i, 0, st.size()) {
		int k = st[i];
		V<int> di(n, -1);
		priority_queue<Pair, V<Pair>, greater<Pair> > pq;
		pq.push({ 0,k });
		int cnt = 0;
		while (pq.size() && cnt < n) {
			Pair p = pq.top();	pq.pop();
			int d = p.first;	int v = p.second;
			if (di[v] == -1) {
				cnt++;
				di[v] = d;
				rep(j, 0, route[v].size()) {
					Pair p = { d + route[v][j].second,route[v][j].first };
					pq.push(p);
				}
			}
		}
		dist[k] = di;
	}
	return dist;
}


int main(void) {
	int N, M, K;	cin >> N >> M >> K;

	V<int> R(K);
	rep(i, 0, K) {
		cin >> R[i];	R[i] -= 1;
	}
	sort(all(R));

	VV<int> edge(M, V<int>(3));
	VV<Pair> route(N, V<Pair>(0));
	rep(i, 0, M) {
		rep(j, 0, 3) {
			cin >> edge[i][j];
		}
		edge[i][0] -= 1;	edge[i][1] -= 1;
		route[edge[i][0]].push_back({ edge[i][1],edge[i][2] });
		route[edge[i][1]].push_back({ edge[i][0],edge[i][2] });
	}

	int ans = inf;
	int rsum = 0;
	rep(i, 0, R.size()) {
		rsum += edge[R[i]][2];
	}
	VV<int> dist = dijkstra(N, edge, R, route);


	rep(rbit, 0, 1 << K) {
		V<int> b(K);
		rep(i, 0, K) {
			b[i] = (rbit >> i) & 1;
		}

		VV<int> dp(1 << K, V<int>(K, inf));
		rep(i, 0, K) {
			int p = edge[R[i]][b[i]];
			dp[1 << i][i] = dist[0][p] + rsum;
		}

		rep(bit, 1, 1 << K) {
			rep(s, 0, K) {
				int p = edge[R[s]][b[s] ^ 1];
				if (((bit >> s) & 1) == 0) {
					continue;
				}
				rep(t, 0, K) {
					int np = edge[R[t]][b[t]];
					int k = bit | (1 << t);
					int d = dp[bit][s] + dist[p][np];
					if (((bit >> t) & 1) == 0 && dp[k][t] > d) {
						dp[k][t] = d;
					}
				}
			}
		}

		int c = inf;
		rep(i, 0, K) {
			int p = edge[R[i]][b[i] ^ 1];
			int d = dp[(1 << K) - 1][i] + dist[p][N - 1];
			if (c > d) {
				c = d;
			}
		}

		if (ans > c) {
			ans = c;
		}
	}


	cout << ans << endl;
	return 0;
}