#include <bits/stdc++.h>
using namespace std;

const int INF = 1 << 26;
struct Edge {
	int u, v, c;
	bool operator<(const Edge& other) const {
		return c < other.c;
	}
};

int N, M, T, ts[50];
Edge E[777];
int dist[50][50];

int root[50];
inline int find(int x){
	if(x == root[x])return x;
	return root[x] = find(root[x]);
}
inline bool conn(int x, int y){
	x = find(x);
	y = find(y);
	if(x == y)return false;

	root[x] = y;
	return true;
}


int rest_v[50];
int use[50];
inline int min_spanning_tree(){
	for(int i=0;i<N;i++)root[i] = i;

	int res = 0;
	for(int i=0;i<M;i++){
		int u = E[i].u, v = E[i].v, c = E[i].c;
		if(!use[u] || !use[v])continue;
		if(conn(u, v)){
			res += c;
		}
	}

	return res;
}

int OPT[1<<15][50];
int min_steiner_tree(){
  for(int i=0;i<N;i++)for(int j=0;j<N;j++)dist[i][j] = INF;
  for(int i=0;i<N;i++)dist[i][i] = 0;
  for(int i=0;i<M;i++){
  	int u = E[i].u, v = E[i].v, c = E[i].c;
  	dist[u][v] = c;
  	dist[v][u] = c;
  }
  
  const int n = N;
  const int numT = T;
  if (numT <= 1) return 0;

  for (int S = 0; S < (1 << numT); ++S)
    for (int x = 0; x < n; ++x)
      OPT[S][x] = INF;

  for (int p = 0; p < numT; ++p) // trivial case
    for (int q = 0; q < n; ++q)
      OPT[1 << p][q] = dist[ts[p]][q];

  for (int S = 1; S < (1 << numT); ++S) { // DP step
    if (!(S & (S-1))) continue;
    for (int p = 0; p < n; ++p)
      for (int E = (S-1)&S; E ; E = (E-1)&S)
          OPT[S][p] = min( OPT[S][p], OPT[E][p] + OPT[S-E][p] );
    for (int p = 0; p < n; ++p)
      for (int q = 0; q < n; ++q)
        OPT[S][p] = min( OPT[S][p], OPT[S][q] + dist[p][q] );
  }
  int ans = INF;
  for (int S = 0; S < (1 << numT); ++S)
    for (int q = 0; q < n; ++q)
      ans = min(ans, OPT[S][q] + OPT[((1 << numT)-1)-S][q]);
  return ans;
}

int main(){
	cin >> N >> M >> T;
	for(int i=0;i<M;i++){
		int u, v, c;
		cin >> u >> v >> c;
		E[i] = Edge{u-1, v-1, c};
	}
	for(int i=0;i<T;i++)cin >> ts[i], ts[i]--;

	int res;
	if(T <= 14){
		res = min_steiner_tree();
	} else {
		for(int i=0;i<T;i++)use[ts[i]] = true;

		int rest = 0;
		for(int i=0;i<N;i++)if(!use[i]){
			rest_v[rest++] = i;
		}

		sort(E, E + M);
		res = 1 << 29;

		for(int mask=0;mask<1<<rest;mask++){
			for(int i=0;i<rest;i++){
				if((mask >> i) & 1){
					use[rest_v[i]] = true;
				}
			}

			res = min(res, min_spanning_tree());

			for(int i=0;i<rest;i++){
				if((mask >> i) & 1){
					use[rest_v[i]] = false;
				}
			}
		}
	}

	cout << res << endl;
	return 0;
}