#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned ll
#define vec vector
#define flist forward_list
#define um unordered_map
#define us unordered_set
#define prioq priority_queue
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ld long double
#define pll pair<ll, ll>

#define LL_MAX LLONG_MAX
#define LL_MIN LLONG_MIN
#define ULL_MAX ULLONG_MAX
#define LD_MAX LDBL_MAX
#define LD_MIN LDBL_MIN

const long long INF = (1ll << 59);

#define nl '\n'

#define vv(type, name, n, ...) vector<vector<type>> name(n, vector<type>(__VA_ARGS__))
#define vvv(type, name, n, m, ...)                                                                                     \
    vector<vector<vector<type>>> name(n, vector<vector<type>>(m, vector<type>(__VA_ARGS__)))

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rep1e(n) for(ll i=1; i<=(ll)(n); ++i)
#define rep2e(i,n) for(ll i=1; i<=(ll)(n); ++i)
#define rep3e(i,a,b) for(ll i=(ll)(a); i<=(ll)(b); ++i)
#define rep4e(i,a,b,c) for(ll i=(ll)(a); i<=(ll)(b); i+=(c))
#define repe(...) cut4(__VA_ARGS__,rep4e,rep3e,rep2e,rep1e)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define per1e(n) for(ll i=((ll)n); i>=1; --i)
#define per2e(i,n) for(ll i=((ll)n); i>=1; --i)
#define per3e(i,a,b) for(ll i=((ll)a); i>=(ll)(b); --i)
#define per4e(i,a,b,c) for(ll i=((ll)a); i>=(ll)(b); i-=(c))
#define pere(...) cut4(__VA_ARGS__,per4e,per3e,per2e,per1e)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))
// #define forit(v) for (auto it = v.begin(); it != v.end(); it++)
// #define forit2(it, v) for (auto it = v.begin(); it != v.end(); it++)
// #define forrit(v) for (auto it = v.rbegin(); it != v.rend(); it++)
// #define forrit2(it, v) for (auto it = v.rbegin(); it != v.rend(); it++)

// #ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<vector<T>> x){cerr << "\n"; for(auto i: x) {for(auto j : i) {cerr << j << ' ';} cerr << "\n";}}
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
// #else
// #define bug(...) 777771449
// #endif

const ll MOD = 1e9 + 7;

const string FILENAME = "ubuntzei";
ifstream fin(FILENAME + ".in");
ofstream fout(FILENAME + ".out");

#define cin fin
#define cout fout

class Graph
{
public:

	ll n;
	vec<vec<ll>> adj;
	
	void read();
	void solve();
	void genTrueGraph(ll start, vec<flist<pll>>& fakeAdj, vec<ll>& trueInd);
};

int main()
{
	Graph g;
	g.read();
	g.solve();
	
    return 0;
}

void Graph::solve()
{
	rep(k, n) rep(i, n) rep(j, n) adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
	vv(ll, dp, n, (1ll << n), INF);
	
	prioq<tuple<ll, ll, ll>, vec<tuple<ll, ll, ll>>, greater<tuple<ll, ll, ll>>> nn;
	nn.push({0, 0, 1});
	dp[0][1] = 0;
	
	while(!nn.empty())
	{
		ll d, u, mask;
		tie(d, u, mask) = nn.top(); nn.pop();
		if(dp[u][mask] != d) continue;
		
		rep(v, n)
		{
			if(mask & (1ll << v)) continue;
			if(mask != (1ll << (n-1)) - 1 && v == n-1) continue;
			
			if(dp[v][mask | (1ll << v)] > dp[u][mask] + adj[u][v])
			{
				dp[v][mask | (1ll << v)] = dp[u][mask] + adj[u][v];
				if(v != n-1) nn.push({dp[v][mask | (1ll << v)], v, mask | (1ll << v)});
			}
		}
	}
	
	cout << dp[n-1][(1ll << n)-1];
}
void Graph::genTrueGraph(ll start, vec<flist<pll>>& fakeAdj, vec<ll>& trueInd)
{
	prioq<pll, vec<pll>, greater<pll>> nn;
	vec<ll> dist(n, INF);
	dist[start] = 0;
	nn.push({0, start});
	
	while(!nn.empty())
	{
		ll d = nn.top().fi, u = nn.top().se;
		nn.pop();
		if(dist[u] != d) continue;
		
		for(auto ed : fakeAdj[u])
		{
			if(dist[ed.fi] > dist[u] + ed.se)
			{
				dist[ed.fi] = dist[u] + ed.se;
				nn.push({dist[ed.fi], ed.fi});
			}
		}
	}
	
	rep(n)
	{
		if(trueInd[i] != -1)
		{
			adj[trueInd[start]][trueInd[i]] = adj[trueInd[i]][trueInd[start]] = dist[i];
		}
	}
}
void Graph::read()
{
	vec<flist<pll>> fakeAdj;
	vec<ll> trueInd;
	
	ll m, k;
	cin >> n >> m >> k;
	trueInd.assign(n, -1);
	fakeAdj.resize(n);
	adj.assign(k+2, vec<ll>(k+2, INF));
	
	rep(k)
	{
		ll x;
		cin >> x;
		trueInd[--x] = i+1;
	}
	rep(m)
	{
		ll a, b, c;
		cin >> a >> b >> c;
		a--, b--;
		fakeAdj[a].pf({b, c});
		fakeAdj[b].pf({a, c});
	}
	
	trueInd[0] = 0;
	trueInd[n-1] = k+1;
	
	rep(n) if(trueInd[i] != -1) genTrueGraph(i, fakeAdj, trueInd);
	n = k+2;
}