#include <bits/stdc++.h>
#define MAXN 2010
#define INF 1000000100
using namespace std;
ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");
vector <pair<int,int> > G[MAXN];
priority_queue <pair<int,pair<int,int> > >PQ;
int dp[33333][MAXN],pr[MAXN],x,y,c,k,nod,stare,n,m;
pair<int,pair<int,int> > aux;
int main()
{
    f>>n>>m;
    f>>k;
    for(int i=0;i<k;i++)
    {
        f>>x;
        pr[x]=(1<<i);
    }
    while(m--)
    {
        f>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
        G[y].push_back(make_pair(x,c));
    }
    for(int i=1;i<=(1<<(k+1));i++)
        dp[0][i]=INF;
    for(int i=1;i<=(1<<(k+1));i++)
        for(int j=1;j<=n;j++)
        dp[i][j]=INF;
    dp[0][1]=0;
    PQ.push(make_pair(0,make_pair(0,1)));

    while(PQ.size())
    {
        aux=PQ.top();
        PQ.pop();
        stare=aux.second.first;
        nod=aux.second.second;

        for(auto it:G[nod])
            if(dp[(stare|pr[nod])][it.first]>=dp[stare][nod]+it.second)
            {
                dp[(stare|pr[nod])][it.first]=dp[stare][nod]+it.second;
                PQ.push(make_pair(-dp[(stare|pr[nod])][it.first],make_pair((stare|pr[nod]),it.first)));
            }
    }

    g<<dp[(1<<k)-1][n];
    return 0;
}