#include <bits/stdc++.h>
#define piii pair<pair<int,int>,int>
using namespace std;
ifstream fin("ubuntzei.in");
ofstream fout("ubuntzei.out");
vector<pair<int,int> >nod[2005];
int n,m,k,x,y,c;
int pretin[20];
int val[2005];
vector<int>elem[2005];
bitset<32800>ap[2005];
priority_queue<piii,vector<piii >,greater<piii > >pq;
int main()
{
    fin>>n>>m>>k;
    for(int i=1;i<=n;i++) val[i]=-1;
    for(int i=0;i<k;i++)
    {
        fin>>pretin[i];
        val[pretin[i]]=i;
    }
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        nod[x].push_back({y,c});
        nod[y].push_back({x,c});
    }
    pq.push({{0,0},1});
    while(!pq.empty())
    {
        int cst=pq.top().first.first;
        int v=-pq.top().first.second;
        int pos=pq.top().second;
        pq.pop();
        if(ap[pos][v]) continue;
        bool ok=true;
        for(int i=0;i<elem[pos].size();i++) if(elem[pos][i]^v==elem[pos][i]-v) {ok=false;break;}
        if(!ok) continue;
        elem[pos].push_back(v);
        ap[pos][v]=1;
        if(pos==n && (1<<k)-1==v)
        {
            fout<<cst;
            return 0;
        }
        for(int i=0;i<nod[pos].size();i++)
        {
            int counter=v;
            if(val[nod[pos][i].first]!=-1)
            {
                if((counter&(1<<val[nod[pos][i].first]))!=0) continue;
                counter+=(1<<val[nod[pos][i].first]);
            }
            if(ap[nod[pos][i].first][counter]) continue;
            bool k=true;
            for(int j=0;j<elem[nod[pos][i].first].size();j++) if(elem[nod[pos][i].first][j]^counter==elem[nod[pos][i].first][j]-counter) {k=false;break;}
            if(!k) continue;
            pq.push({{nod[pos][i].second+cst,-counter},nod[pos][i].first});
        }
    }
    return 0;
}