#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
#define Nmax 2050
#define Minim(x,y) (x<y?x:y)
using namespace std;

vector <pair <int, int> > Graf[Nmax];
priority_queue < pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > Coada;
int D[Nmax][Nmax];

int N,M,K;
int Ksir[20];

int DP[20][1<<20];
int Minim;


void Citire()
{
    int x,y,c;
    scanf("%d %d",&N,&M);
    scanf("%d ",&K);
    Ksir[1]=1;
    for(int i=2;i<=K+1;++i)
            scanf("%d ",&Ksir[i]);
    K++;
    Ksir[++K]=N;
    for(int i=1;i<=M;++i)
    {
        scanf("%d %d %d",&x,&y,&c);
        Graf[x].push_back(make_pair(c,y));
        Graf[y].push_back(make_pair(c,x));
    }
    for(int i=1;i<=N;++i)
        for(int j=1;j<=N;++j)
            if(i!=j)
                D[i][j]=INF;

}

void Dijkstra(int i)
{
    Coada.push(make_pair(0,i));
    while(!Coada.empty())
    {
        int t=Coada.top().second;
        Coada.pop();
        for(int j=0;j<Graf[t].size();++j)
        {
            int v=Graf[t][j].second;
            int c=Graf[t][j].first;
            if(D[i][v]>D[i][t]+c)
            {
                D[i][v]=D[i][t]+c;
                Coada.push(make_pair(D[i][v],v));
            }
        }
    }
}


void Formare()
{
    for(int s=1;s<(1<<K);++s)
        for(int i=1;i<=K;++i)
            DP[s][i]=INF;
}

int Rezolvare()
{
    int Min;
    for(int i=1;i<=(1<<K);++i)
        for(int j=1;j<=K;++j)
        {
            if(i==(1<<j))
            {
                DP[i][j]=D[1][j];
                continue;
            }
            Min=DP[i][j];
            for(int l=1;l<=K;++l)
                if(l!=j && Min<DP[i & (1<<l)][l]+D[l][j])
                    Min=DP[i & (1<<l)][l]+D[l][j];
            DP[i][j]=Min;
        }
}


int main()
{
    freopen("ubuntzei.in","r",stdin);
    freopen("ubuntzei.out","w",stdout);
    Citire();
    for(int i=1;i<=K;++i)
        Dijkstra(Ksir[i]);
    Formare();
    Rezolvare();
    printf("%d",DP[1<<K][K]);
    return 0;
}