#include <bits/stdc++.h>
using namespace std;
ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");
struct nod{
    int nr,val;
    nod *urm;
};
nod *a[2001],*p,*prim,*ultim;
int n,m,k,d[2001],prieten[2001],L[2001][2001],mini=1000000000,viz[2001];
vector <int> v;

void citire()
{
    f>>n>>m>>k;
    if(k>0)
        for(int i=1;i<=k;i++)
            f>>prieten[i];
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        f>>x>>y>>z;
        p=new nod;
        p->nr=y;
        p->val=z;
        p->urm=0;
        p->urm=a[x];
        a[x]=p;

        p=new nod;
        p->nr=x;
        p->val=z;
        p->urm=0;
        p->urm=a[y];
        a[y]=p;
    }
}

void dijkstra(int v1)
{
    for(int i=1;i<=n;i++)
        d[i]=99999999;
    d[v1]=0;
    prim=new nod;
    prim->nr=v1;
    prim->urm=NULL;
    ultim=prim;
    while(prim)
    {
        int nod1=prim->nr;
        nod *q=a[nod1];
        while(q)
        {
            if(d[q->nr]>d[nod1]+q->val)
            {
                d[q->nr]=d[nod1]+q->val;
                p=new nod;
                p->nr=q->nr;
                p->urm=NULL;
                ultim->urm=p;
                ultim=p;
            }
            q=q->urm;
        }
        p=prim;
        prim=prim->urm;
        delete p;
    }
}

int sum()
{
    int s=L[1][prieten[v[0]]]+L[prieten[v[k-1]]][n];
    if(k>=2)
        for(int i=0;i<k-1;i++)
            s+=L[prieten[v[i]]][prieten[v[i+1]]];
    return s;
}

void perm()
{
    for(int i=0;i<k;i++)
         v.push_back(i+1);

    do
    {
        int s=sum();
        if(mini>s && s)
            mini=s;
    } while(next_permutation(v.begin(), v.end()));
}

int main()
{
    citire();
    dijkstra(1);
    for(int j=1;j<=n;j++)
        L[1][j]=d[j];
    dijkstra(n);
    for(int j=1;j<=n;j++)
        L[n][j]=d[j];
    for(int i=1;i<=k;i++)
    {
        dijkstra(prieten[i]);
        for(int j=1;j<=n;j++)
            L[prieten[i]][j]=d[j];
    }
    if(k>0)
        perm(),g<<mini;
    else
        g<<L[1][n];
    return 0;
}