#include <bits/stdc++.h>  // ver2.2.6
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,i) upper_bound(ALL(a),i)-lower_bound(ALL(a),i)
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define _ <<' '<<
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define leng(n) (int)(log10(n)+1)
#define dem(a,b) ((a+b-1)/(b))
#define Vin(a) rep(iI,0,a.size())cin>>a[iI]
#define Vout(a) rep(lZ,0,a.size()-1)cout<<a[lZ]<<' ';cout<<a.back()<<endl
#define VVout(a) rep(lY,0,a.size()){Vout(a[lY]);}
#define VPout(a) rep(lX,0,a.size())cout<<a[lX].FI<<' '<<a[lX].SE<<endl
#define Verr(a) rep(iZ,0,a.size()-1)cerr<<a[iZ]<<' ';cerr<<a.back()<<endl
#define VVerr(a) rep(iY,0,a.size()){Verr(a[iY]);}
#define VPerr(a) rep(iX,0,a.size())cerr<<a[iX].FI<<' '<<a[iX].SE<<endl
#define INF 3000000000000000000  //  3.0*10^18(MAXの1/3くらい)
#define MAX LLONG_MAX
#define MOD 1000000007  //  10^9 + 7
using namespace std;

int gcd(int a,int b){return b?gcd(b,a%b):a;}  //  最大公約数gcd
int lcm(int a,int b){return a/gcd(a,b)*b;}  //  最小公倍数lcm
void press(auto &v){v.erase(unique(ALL(v)),v.end());}  //  圧縮
int mypow(int x, int n, int m){  //  累乗x^n(mod m)  O(log(n))
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}

VVi gr;
Vi dist;

void shortest(int s){
  int n = dist.size();
  rep(i,0,n) dist[i]=INF;
  dist[s] = 0;
  
  priority_queue<Tiii,vector<Tiii>,greater<Tiii>> q;
  q.push(make_tuple(0,s,-1));
  
  while(!q.empty()){
    int nowdist,now,past;
    tie(nowdist,now,past) = q.top();
    q.pop();
    
    if(nowdist>dist[now]) continue;
    
    dist[now]=nowdist;
    
    rep(i,0,n){
      if(gr[now][i]==-1) continue;
      int next = i,cost = gr[now][i];
      if(next!=past && nowdist+cost<dist[next]){
        q.push(make_tuple(nowdist+cost,next,now));
        dist[next]=nowdist+cost;
      }
    }
  }
  return;
}


signed main() {
  cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
  int n,m,r;
  cin >> n >> m >> r;
  Vi goo(r);
  Vin(goo);
  rep(i,0,r) goo[i]--;
  sort(ALL(goo));
  
  int qw,er,ty;
  
  gr = VVi(n,Vi(n,-1));
  
  rep(i,0,m){
    cin >> qw >> er >> ty;
    qw--,er--;
    gr[qw][er] = ty;
    gr[er][qw] = ty;
  }
  
  VVi smap(n);
  dist = Vi(n,0);
  
  rep(i,0,n){
    shortest(i);
    smap[i] = dist;
  }
  VVerr(smap);
  int ans = INF;
  do {
    int now = 0;
    rep(i,0,r-1){
      now += smap[goo[i]][goo[i+1]];
    }
    ans = min(ans,now);
    
  } while (next_permutation(ALL(goo)));
  
  cout<<ans<<endl;
  return 0;
}

Measured memory_bytes: 896