#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ubuntzei.in");
ofstream fout("ubuntzei.out");
int n,m,c[2000][2000],v[2000],k;
void cit(){
    fin>>n>>m;
    fin>>k;
    int i,j,cost,h;
    for(i=1;i<=k;i++)
        fin>>v[i];
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(i!=j)
                c[i][j]=100000000;
    for(h=1;h<=m;h++){
        fin>>i>>j>>cost;
        c[i][j]=c[j][i]=cost;
    }
}
void roy_floyd()
    {
    int i, j, h;
    for (h = 1; h <= n; h++)
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if (c[i][h] && c[h][j] && (c[i][j] > c[i][h] + c[h][j] || !c[i][j]) && i != j) c[i][j] = c[i][h] + c[h][j];
}
int main(){
    cit();
    roy_floyd();
    int S=0,Min=100000000;
    if(k==0){
        fout<<c[1][n];
        return 0;}
    else{
        do{
            S+=c[1][v[1]];
            for(int i=1;i<k;i++)
                S+=c[v[i]][v[i+1]];
            S+=c[v[k]][n];
            Min=min(Min,S);
        }while(next_permutation(v+1,v+k+1));
        fout<<Min;}
    return 0;}