//ダイクストラ高速化弱め

#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;


int dijkstra(int n, int start, int finish, VV<Pair>& route) {
	V<int> path(n, -1);
	priority_queue<Pair, V<Pair>, greater<Pair> > pq;
	pq.push({ 0,start });
	while (pq.size()) {
		Pair p = pq.top();	pq.pop();
		int d = p.first;	int v = p.second;
		if (path[v] == -1) {
			path[v] = d;
			if (v == finish) {
				break;
			}
			rep(i, 0, route[v].size()) {
				Pair p = { d + route[v][i].second,route[v][i].first };
				pq.push(p);
			}
		}
	}
	return path[finish];
}


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(N, V<int>(N, inf));


	V<VV<int> > dp(1 << K, VV<int>(K, V<int>(2, inf)));
	rep(i, 0, K) {
		rep(j, 0, 2) {
			int p = 0;	int q = edge[R[i]][j];
			if (dist[p][q] == inf) {
				dist[p][q] = dist[q][p] = dijkstra(N, p, q, route);
			}
			dp[1 << i][i][j] = rsum + dist[p][q];
		}
	}
	rep(bit, 1, 1 << K) {
		rep(s, 0, K) {
			if ((bit & (1 << s)) == 0) {
				continue;
			}
			rep(i, 0, 2) {
				rep(t, 0, K) {
					if (bit & (1 << t)) {
						continue;
					}
					int b = bit | (1 << t);
					rep(j, 0, 2) {
						int p = edge[R[s]][i];	int q = edge[R[t]][j];
						if (dist[p][q] == inf) {
							dist[p][q] = dist[q][p] = dijkstra(N, p, q, route);
						}
						int d = dp[bit][s][i ^ 1] + dist[p][q];
						if (dp[b][t][j] > d) {
							dp[b][t][j] = d;
						}
					}
				}
			}
		}
	}

	ans = inf;
	rep(i, 0, K) {
		rep(j, 0, 2) {
			int p = edge[R[i]][j];	int q = N - 1;
			if (dist[p][q] == inf) {
				dist[p][q] = dist[q][p] = dijkstra(N, p, q, route);
			}
			int d = dp[(1 << K) - 1][i][j ^ 1] + dist[p][q];
			if (ans > d) {
				ans = d;
			}
		}
	}

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