#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <algorithm>
#define inf 1e9

using namespace std;

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

const int N=2000;
const int M=10001;
const int K=17;

int cost[N][N],d[N],prt[K],n,dp[131072][K];
priority_queue < pair<int,int> > q;
vector < pair<int,int> > v[N];
bool sel[N];

void dijkstra (int nod)
{
    for (int i=0;i<n;i++)
    {
        d[i]=inf;
        sel[i]=false;
    }
    d[nod]=0;
    q.push(make_pair(0,nod));
    while (!q.empty())
    {
        while (!q.empty() && sel[q.top().second])
            q.pop();
        if (q.empty()) continue;
        int x=q.top().second;
        sel[x]=true;
        for (int i=0;i<v[x].size();i++)
        {
            int y=v[x][i].first;
            int c=v[x][i].second;
            if (d[x]+c<d[y])
            {
                d[y]=d[x]+c;
                q.push(make_pair(-d[y],y));
            }
        }

    }
    //cout<<3;
    for (int i=0;i<n;i++)
    {
        cost[nod][i]=min(cost[nod][i],d[i]);
        cost[i][nod]=min(cost[i][nod],d[i]);
    }

}
void afis (int k)
{
    for (int i=1;i< (1<<k);i++)
    {
        for (int j=0;j<k;j++)
            out<<dp[i][j]<<' ';
        out<<'\n';
    }
    out<<'\n';
}
int main()
{
    int m,k,x,y,c;
    in>>n>>m>>k;
    for (int i=0;i<k;i++)
    {
        in>>prt[i];
        prt[i]--;
    }
    prt[k++]=0;
    prt[k++]=n-1;
    sort (prt,prt+k);
    for (int i=1;i<=m;i++)
    {
        in>>x>>y>>c;
        x--;
        y--;
        v[x].push_back(make_pair(y,c));
        v[y].push_back(make_pair(x,c));
    }

    for (int i=0;i<n;i++)
        for (int j=0;j<n;j++)
            cost[i][j]=inf;
    for (int i=0;i< (1<<k);i++)
        for (int j=0;j<k;j++)
            dp[i][j]=inf;

    for (int i=0;i<k;i++)
        dijkstra (prt[i]);

    dp[1][0]=0;
    for (int i=1;i< (1<<k);i++)
        for (int j=0;j<k;j++)
            if (i & (1<<j))
                for (int l=0;l<k;l++)
                    if (i & (1<<l))
                        dp[i][j]=min(dp[i][j],dp[i^ (1<<j)][l]+cost[prt[l]][prt[j]]);
    out<<dp[(1<<k)-1][k-1];
    //afis (k);
    return 0;
}