#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
#include <cstdio>
#define inf 0x3f3f3f3f
#define N 20005
#define M 50000

using namespace std;

vector <pair <int, int> > g[N];
vector <pair <int, int> >::iterator it;
int n, m, k, o[N], d[16][M], c[N], cost[N][N];

void citire()
{
    scanf("%d %d\n", &n, &m);
    scanf("%d ", &k);
    for(int i=0;i<k;i++)
        scanf("%d ", &o[i]);
    o[k++]=n;
    for(int i=1;i<=m;i++)
    {
        int x, y, cc;
        scanf("%d %d %d\n", &x, &y, &cc);
        g[x].push_back(make_pair(y, cc));
        g[y].push_back(make_pair(x, cc));
    }

}

void bellman(int x)
{
    memset(c, inf, sizeof(c));
    queue <int> q;
    c[x]=0;
    q.push(x);

    while(!q.empty())
    {
        int v=q.front();
        q.pop();
        for(it=g[v].begin();it!=g[v].end();it++)
        {
            if(c[v]+it->second<c[it->first])
            {
                c[it->first]=c[v]+it->second;
                q.push(it->first);
            }
        }
    }
}

void dfs(int drum)
{
    for(int nod=0;nod<k;nod++)
        if(drum&(1<<nod))
            for(int i=0;i<k;i++)
                if(drum&(1<<i))
                    d[nod][drum]=min(d[nod][drum], d[i][drum^(1<<nod)]+cost[i][o[nod]]);
}

int main()
{
    freopen("ubuntzei.in", "r", stdin);
    freopen("ubuntzei.out", "w", stdout);

    citire();
    for(int i=0;i<k;i++)
    {
        bellman(o[i]);
        for(int j=0;j<=n;j++)
            cost[i][j]=c[j];
    }

    memset(d, inf, sizeof(d));
    for(int i=0;i<k;i++)
        d[i][1<<i]=cost[i][1];

    for(int i=1;i<=(1<<k);i++)
        dfs(i);

    printf("%d", d[k-1][(1<<k)-1]);
    return 0;
}