#include <bits/stdc++.h>

#define NMAX 201
#define KMAX 15

using namespace std;

typedef pair<int,int> wow;
ifstream fin("ubuntzei.in");
ofstream fout("ubuntzei.out");
short n,m,k,x,y,z,confFinala;
struct Edge{
    short x;
    int cost;
};
vector<Edge> g[NMAX];
int stops[NMAX];
int dp[(1<<(KMAX+1))][NMAX];
bool inMatrice[(1<<KMAX)][NMAX];
queue<wow>Q;

void bellman() {
    dp[0][1]=0;
    inMatrice[0][1]=1;

    for(Q.push(make_pair(0,1));Q.size();) {
        int confAc = Q.front().first;
        int nodAc = Q.front().second;

        Q.pop();
        inMatrice[confAc][nodAc]=0;

        for(auto q:g[nodAc]) {
            int copieConf = confAc;
            int nodUrm=q.x;
            int costMuchie=q.cost;

            if(stops[nodUrm]) {
                confAc = confAc | (1<<(stops[nodUrm]-1));
            }
            if(dp[copieConf][nodAc]+costMuchie<dp[confAc][nodUrm]) {
                dp[confAc][nodUrm]=dp[copieConf][nodAc]+costMuchie;
                if(!inMatrice[copieConf][nodUrm]) {
                    inMatrice[copieConf][nodUrm]=1;
                    Q.push(make_pair(confAc,nodUrm));
                }
            }
        }
    }
}

int main()
{
    fin>>n>>m>>k;
    confFinala = (1<<k)-1;
    for(int i=1;i<=k;i++) {
        fin>>x;
        stops[x]=i;
    }
    for(int i=1;i<=m;i++) {
        fin>>x>>y>>z;
        g[x].push_back({y,z});
        g[y].push_back({x,z});
    }
    for(int i=0;i<(1<<KMAX);i++) for(int j=1;j<=n;j++) dp[i][j]=0x3f3f3f3f;

    bellman();
    fout<<dp[confFinala][n];
    return 0;
}