#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Edge {
	int to;
	long long cost;
	Edge(int _to, long long _cost) :to(_to), cost(_cost) {}
};
vector<Edge>g[200005];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, l; cin >> n >> m >> l;
	vector<int>r(l);
	rep(i, l)cin >> r[i], r[i]--;
	vector<int>a(m), b(m), c(m);
	rep(i, m) {
		cin >> a[i] >> b[i] >> c[i];
		a[i]--; b[i]--;
		g[a[i]].emplace_back(b[i], c[i]);
		g[b[i]].emplace_back(a[i], c[i]);
	}
	vector<vector<long long>> dist(l * 2, vector<long long>(n, LINF));
	rep(i, l * 2) {// dikstra
		int st = 0;
		if (0 == i % 2)st = a[r[i / 2]];
		else st = b[r[i / 2]];
		priority_queue<P, vector<P>, greater<P>> q;
		q.push({ 0, st });
		dist[i][st] = 0;
		while (!q.empty()) {
			auto tmp = q.top();
			q.pop();
			long long cost = tmp.first;
			int pos = tmp.second;
			if (cost > dist[i][pos]) continue;
			for (Edge e : g[pos]) {
				long long ncost = cost + e.cost;
				int npos = e.to;
				if (chmin(dist[i][npos], ncost)) q.push({ ncost, npos });
			}
		}
	}
	vector<vector<vector<long long>>> dp(1 << l, vector<vector<long long>>(l, vector<long long>(2, LINF)));
	rep(i, l) {
		dp[1 << i][i][0] = dist[2 * i + 1][0] + c[r[i]];
		dp[1 << i][i][1] = dist[2 * i + 0][0] + c[r[i]];
	}
	rep(i, 1 << l) rep(j, l)rep(k, 2) {
		if (LINF == dp[i][j][k])continue;
		rep(nj, l) {
			if (1 & (i >> nj))continue;
			int ni = i | (1 << nj);
			rep(nk, 2) {
				int st, ed;
				if (0 == k)st = j * 2;
				else st = j * 2 + 1;
				if (0 == nk)ed = b[r[nj]];
				else ed = a[r[nj]];
				long long ncost = dp[i][j][k] + dist[st][ed] + c[r[nj]];
				chmin(dp[ni][nj][nk], ncost);
			}
		}
	}
	long long ans = LINF;
	rep(i, l) rep(j, 2) {
		long long sub = dp[(1 << l) - 1][i][j];
		sub += dist[i * 2 + j][n - 1];
		chmin(ans, sub);
	}
	cout << ans << endl;
	return 0;
}