#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#define INF 999999999

using namespace std;

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

vector<pair<int,int> > v[2001];
int drum[17][2001];
queue<int> q;
int n,m,k,C[16],solmin=INF;
int sol[1<<16];
int used[16],lastused;

int main()
{
    fin>>n>>m>>k;
    for(int i=1;i<=k;i++)
        fin>>C[i];
    int x,co,y;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>co;
        v[x].push_back(make_pair(y,co));
        v[y].push_back(make_pair(x,co));
    }
    for(int i=0;i<=k;i++)
        for(int j=1;j<=n;j++)
            drum[i][j] = INF;
    C[0] = 1;
    for(int p = 0; p <= k; p++)
    {
        q.push(C[p]);
        drum[p][C[p]] = 0;
        while(!q.empty())
        {
            int nod = q.front();
            for(unsigned int i=0;i<v[nod].size();i++)
                if(drum[p][nod] + v[nod][i].second < drum[p][v[nod][i].first])
                {
                    q.push(v[nod][i].first);
                    drum[p][v[nod][i].first] = drum[p][nod] + v[nod][i].second;
                }
            q.pop();
        }
    }
    for(int nr=0;nr<(1<<k);nr++)
        sol[nr] = INF;
    for(int dr = 0; dr<k;dr++)
        sol[1<<dr] = drum[0][C[dr+1]];

    for(int nr=0;nr<(1<<k);nr++)
    {
        for(int dr = 0; dr<k;dr++)
            if((nr & (1<<dr)) != 1<<dr) // ii vizitat
            {
                int aux = nr - (1<<dr);

                for(int last = 0; last<k;last++ )
                    if((aux & (1<<last)) != (1<<dr))
                        if(sol[nr] < sol[aux] + drum[last+1][C[dr+1]])
                            {sol[nr] = sol[aux] + drum[last+1][C[dr+1]];lastused = last+1;}
            }
    }

    fout<<sol[(1<<k) -1 ] + drum[lastused][n];
    fin.close();
    fout.close();
    return 0;
}