#include <bits/stdc++.h>
#define int64 long long
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
using namespace std;
ifstream in("ubuntzei.in");
ofstream out("ubuntzei.out");
vector< vector< pair<int,int> > > a;
queue<int> q;
vector<bool> use;
int n,m,k,c[20];
void bellman(int st,vector<int>& d)
{
    use=vector<bool> (n+1);
    d=vector<int> (n+1,INF);
    q.push(st);
    use[st]=true;
    d[st]=0;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        use[x]=false;
        for(auto i: a[x])
        if(d[x] + i.second < d[i.first])
        {
            d[i.first]=d[x] + i.second;
            if(use[i.first]==false)
            {
                use[i.first]=true;
                q.push(i.first);
            }
        }
    }
}
vector<int> v;
int d[20][20],st[20];
int main()
{
    in>>n>>m>>k;
    a=vector< vector< pair<int,int> > > (n+1);
    for(int i=2;i<=k+1;i++)
        in>>c[i];
    c[1]=1;
    c[k+2]=n;
    k+=2;
    for(;m;m--)
    {
        int x,y,z;
        in>>x>>y>>z;
        a[x].pb(mp(y,z));
        a[y].pb(mp(x,z));
    }
    for(int i=1;i<=k;i++)
    {
        st[i]=i;
        bellman(c[i],v);
        for(int j=1;j<=k;j++)
            d[i][j]=v[c[j]];
    }
    int sol=INF;
    do{
        int cost=0;
        for(int i=2;i<=k+2;i++)
            cost+=d[st[i-1]][st[i]];
        sol=min(cost,sol);
    }while(next_permutation(st+2,st+k));
    out<<sol<<'\n';
    return 0;
}