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

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> void chmax(t&a,u b){if(a<b)a=b;};
template<class t, class u> void chmin(t&a,u b){if(a>b)a=b;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

class Warshall_Floyd{
  //Warshall-Floyd algorithm
  //calculation time complexity: O(|V|^3)
  //all vertex-vertex minimum distance
  private:
    ll V;
    vector<vector<ll> > d;

  public:
    Warshall_Floyd(ll V, vector<ll> From, vector<ll> To, vector<ll> Cost){
      //num of vertex
      this->V = V;
      d.resize(V);
      for(ll i=0; i<V; ++i){
        d[i].resize(V, INFLL-1);
        d[i][i] = 0;
      }
      ll E = (ll)From.size();
      if((ll)To.size() != E || (ll)Cost.size() != E){
        fprintf(stderr, "Sizes are different, %ld %ld %ld\n", From.size(), To.size(), Cost.size());
        exit(0);
      }

      for(ll i=0; i<E; ++i){
        d[From[i]][To[i]] = Cost[i];
      }
      return;
    };

    ~Warshall_Floyd(void){
      return;
    };

    void shortest_path(void){
      for(ll k=0; k<V; ++k){
        for(ll i=0; i<V; ++i){
          for(ll j=0; j<V; ++j){
            //d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            if(d[i][j] > d[i][k] + d[k][j]){
              d[i][j] = d[i][k] + d[k][j];
            }
          }
        }
      }
      return;
    };

    ll get_distance(ll s, ll e){
      return d[s][e];
    };
};

ll R;
vvll P;

ll search(ll last, ll state, ll dist){
  if(state==(1<<R)-1) return dist;
  ll init = 1;
  ll dist_tmp = INFLL;
  ll init_count = 0;
  REP(i,R){
    if((state&init)==0){
      ll tmp = search(init_count, (state|init), dist+P[last][init_count]);
      chmin(dist_tmp, tmp);
    }
    init<<=1;
    init_count++;
  }
  return dist_tmp;
}

ll search(void){
  ll init = 1;
  ll init_count = 0;
  ll dist = INFLL;
  REP(i,R){
    ll tmp = search(init_count, init, 0);
    chmin(dist, tmp);
    init<<=1;
    init_count++;
  }
  return dist;
}

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N, M;
  IN(N,M,R);
  vll r(R);
  REP(i,R){
    IN(r[i]);
    r[i]--;
  }

  vll From, To, Cost;

  REP(i,M){
    ll A, B, C;
    IN(A,B,C);
    A--; B--;
    From.pb(A);
    To.pb(B);
    Cost.pb(C);

    From.pb(B);
    To.pb(A);
    Cost.pb(C);
  }

  Warshall_Floyd WF(N, From, To, Cost);
  WF.shortest_path();

  P.resize(R, vll(R, 0));
  REP(i,R){
    REP(j,R){
      P[i][j] = WF.get_distance(r[i], r[j]);
    }
    P[i][i] = 0.0;
  }

  //mat_print(P);

  OUT(search());

  return 0;
}

Measured memory_bytes: 2412