#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2000;
const int INF = 1e9;
const int KMAX = 15;

ifstream fin( "ubuntzei.in" );
ofstream fout( "ubuntzei.out" );

queue <int> q;
vector <pair<int, int>> edges[MAXN];
bool marked[MAXN+1];
int n;
int dist[MAXN];
void bf( int node ) {
  int i;
  for( i = 0; i < n; i++ )
    dist[i] = INF;
  dist[0] = 0;
  q.push( 0 );
  while( !q.empty() ) {
    auto qfront = q.front();
    q.pop();
    marked[qfront] = false;
    for( auto vec: edges[qfront] ) {
      if( dist[vec.first] > dist[qfront] + vec.second ) {
        dist[vec.first] = dist[qfront] + vec.second;
        if( !marked[qfront] ) {
          marked[qfront] = true;
          q.push( vec.first );
        }
      }
    }
  }
}
int dp[MAXN][1<<KMAX];
int nodes[KMAX];
int indexx[MAXN];
int main() {
  int m, i, a, b, cost, mask, k;
  fin >> n >> m;
  fin >> k;
  for( i = 0; i < k; i++ ) {
    fin >> nodes[i];
  }
  sort( nodes, nodes + k );
  for( i = 0; i < k; i++ )
    indexx[nodes[i]] = i;
  for( i = 0; i < m; i++ ) {
    fin >> a >> b >> cost;
    a--;
    b--;
    edges[a].push_back( { b, cost } );
    edges[b].push_back( { a, cost } );
  }
  bf( 0 );
  for( mask = 0; mask < ( 1 << KMAX ); mask++ ) {
    for( i = 0; i < n; i++ )
      dp[i][mask] = INF;
  }
  dp[0][0] = 0;
  for( mask = 0; mask < ( 1 << KMAX ); mask++ ) {
    for( i = 0; i < n; i++ ) {
      if( mask & ( 1 << i ) ) {
        for( auto vec: edges[i] ) {
          dp[vec.first][mask] = min( dp[vec.first][mask], dp[vec.first][mask-(1<<indexx[vec.first])] + vec.second );
        }
      }
    }
  }
  fout << dp[n-1][(1<<k)-1];
  return 0;
}