#include <fstream>
#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cstring>
#include <string>
#define x first
#define y second
using namespace std;
ifstream fin("ubuntzei.in");
ofstream fout("ubuntzei.out");
int i,j,n,m,a,b,k,x,lx,ly,mini,is[2005],ul[2005];
vector <pair<int,int> > v[2005];
vector <int> newnod;
char f[2005][4100];
const int inf = 500000000;
queue <int> q;
int dp[(1<<17)+10][20],cost[20][20],c[2005];
void bfs(int nod,int nn)
{
    int i;
    for(i = 1; i <= n; i++)
            c[i] = inf;
    q.push(nod);
    c[nod] = 0;
    while(q.size())
    {
        int now = q.front();
        for(i = 0; i < v[now].size(); i++)
            if(c[v[now][i].x] > c[now] + v[now][i].y)
                c[v[now][i].x] = c[now] + v[now][i].y, q.push(v[now][i].x);
        q.pop();
    }
    for(i = 0; i < newnod.size(); i++)
        cost[nn][i] = cost[i][nn] = c[newnod[i]];
}
int main()
{
    fin >> n >> m >> k;
    newnod.push_back(1);
    for(i = 1; i <= k; i++)
        fin >> a,newnod.push_back(a);
    newnod.push_back(n);
    k+=2;
    for(i = 1; i <= m; i++)
    {
        int c;
        fin >> a >> b >> c;
        v[a].push_back(make_pair(b,c));
        v[b].push_back(make_pair(a,c));
    }
    for(i = 0; i <= k; i++)
    for(j = 0; j <= k; j++)
        cost[i][j] = inf;

    for(i = 0; i < newnod.size(); i++)
        bfs(newnod[i],i);

    n = k ;
    for(i = 0 ; i < (1 << n); i++)
        for(j = 0; j < n; j++)
            dp[i][j] = inf;
    for(i = 0 ; i < n; i++)
        cost[i][i] = inf;
    dp[1][0] = 0;
    for(i = 1; i < (1<<n); i++)
        for(j = 0; j < n; j++)
            if(i&(1<<j))
                for(a = 0; a < n; a++)
                    dp[i][j] = min(dp[i][j], dp[i ^ (1<<j)][a] + cost[a][j]);

    fout<<dp[(1<<n) - 1][n - 1];

    return 0;
}