#include <fstream>
#include <climits>
#include <vector>
#include <queue>
using namespace std;

//dp[mask][i] = lungimea minima a unui traseu care trece prin
//localitatile date de mask si care se termina in localitatea
//i
//dp[2^i][i] = distmin(0, i)
//dp[masca][j] = min(dp[masca - 2^j][oricare din bitii din masca - 2^j]
//                  + distmin(localitatea data de bit, j))

//ans = min(dp[2^k - 1][i] + distmin(i, n - 1)), cu 0 <= i <= n - 1
//lmao, m-am tampit, am crezut ca in enunt scrie max(15, n - 2), nu min

const int NMAX = 2003;
const int KMAX = 16;
vector <pair <int, int> > g[NMAX];

struct ob
{
    int last;
    int dist;
};
bool operator <(ob a, ob b)
{
    return a.dist > b.dist;
}
long long d[NMAX][NMAX];
int c[KMAX];
priority_queue <ob> q;

long long dp[(1 << KMAX)][NMAX];

void dijkstra(int nod)
{
    q.push({nod, 0});
    d[nod][nod] = 0;
    while (!q.empty())
    {
        ob f = q.top();
        q.pop();
        if (d[nod][f.last] < f.dist)
        {
            continue;
        }
        d[nod][f.last] = f.dist;
        for (pair <int, int> u : g[f.last])
            if (d[nod][u.first] > d[nod][f.last] + u.second)
            {
                d[nod][u.first] = d[nod][f.last] + u.second;
                q.push({u.first, d[nod][u.first]});
            }
    }
}
int main()
{
    ifstream cin("ubuntzei.in");
    ofstream cout("ubuntzei.out");
    int n, m, i, j;
    cin >> n >> m;
    int k;
    cin >> k;
    for (i = 0; i < k; i++)
    {
        cin >> c[i];
        c[i]--;
    }
    for (i = 1; i <= m; i++)
    {
        int a, b, x;
        cin >> a >> b >> x;
        a--;
        b--;
        g[a].push_back({b, x});
        g[b].push_back({a, x});
    }
    for (i = 0; i < n; i++)
    {
        for (j = 0; j < n; j++)
            d[i][j] = LLONG_MAX / 2;
        dijkstra(i);
    }/*
    for (i = 0; i < n; i++, cout << "\n")
        for (j = 0; j < n; j++)
            cout << d[i][j] << " ";
    cout << "\n";*/
    int lim = (1 << k);
    for (i = 0; i < lim; i++)
        for (j = 0; j < n; j++)
            dp[i][j] = LLONG_MAX / 2;
    for (i = 0; i < k; i++)
        dp[1 << i][i] = d[0][c[i]];
    for (i = 1; i < lim; i++)
    {
        vector <int> aux;
        for (j = 0; (1 << j) <= i; j++)
            if ((1 << j) & i)
            {
                aux.push_back(j);
            }
        for (j = 0; j < aux.size(); j++)
        {
            //dp[i][j] = min(dp[i - (1 << j)][
            for (int ind = 0; ind < aux.size(); ind++)
                if (ind != j)
                dp[i][aux[j]] = min(dp[i][aux[j]],
                                    dp[i - (1 << aux[j])][aux[ind]] + d[c[aux[ind]]][c[aux[j]]]);
        }
    }
    long long ans = LLONG_MAX / 2;
    for (i = 0; i < n; i++)
        ans = min(ans, dp[lim - 1][i] + d[i][n - 1]);
    cout << ans;
}