#include<cstdio>
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
struct coord
{
    int c,x;
};
vector <coord> L[2010];
queue <int> q;
int n,m,loc[20],nloc,dist[2005],sol,best[15][1<<15],d[15][2013];

void Citire()
{
    int x,y,c;
    coord aux;
    freopen("ubuntzei.in","r",stdin);
    scanf("%d%d%d",&n,&m,&nloc);
    for(int i=0;i<nloc;i++)
        scanf("%d",&loc[i]);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        aux.x = y;
        aux.c = c;
        L[x].push_back(aux);
        aux.x = x;
        L[y].push_back(aux);
    }
}
void Bellmanford(int x,int v[])
{
    int k,i;
    for(i=1;i<=n;i++)
        v[i] = 2000000000;
    v[x]=0;

    coord aux;
    q.push(x);
    while(!q.empty())
    {
        k=q.front();
        q.pop();
        int N=L[k].size();
        for(i=0;i<N;i++)
        {
            aux=L[k][i];
            if(v[aux.x] > v[k] + aux.c)
            {
                v[aux.x]=v[k]+aux.c;
                q.push(aux.x);
            }
        }
    }
}

void Solve()
{
    Bellmanford(1,dist);
    if(nloc==0)
    {
        freopen("ubuntzei.out","w",stdout);
        printf("%d",dist[n]);
        return ;
    }

    int i,j,ok;
    for(i=0;i<nloc;i++)
        Bellmanford(loc[i],d[i]);
    int mul;
    int nrmul=(1<<nloc)-1;
    for (mul = 1; mul <= nrmul; mul++)
    {
        ok = false;
        for (i=0; i<nloc && !ok; i++)
        {
            if (mul == (1<<i))
            {
                ok = true;
                best[i][mul] = dist[loc[i]];
            }
        }
        if (!ok)
        {
            for (i=0; i<nloc; i++)
            {
                best[i][mul] = 2000000000;
                if ((mul&(1<<i)) != 0)
                {
                    for (j=0; j<nloc; j++)
                    {
                        if (j!=i && (mul&(1<<j))!=0)
                        {
                            best[i][mul] = min (best[i][mul], best[j][mul - (1<<i)] + d[j][loc[i]]);
                        }
                    }
                }
            }
        }
    }
    sol=2000000000;
    for(i=0;i<nloc;i++)
            sol=min(sol,best[i][nrmul]+d[i][n]);

    freopen("ubuntzei.out","w",stdout);
    printf("%d",sol);

}
int main()
{
    Citire();
    Solve();
    return 0;
}