#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>

using namespace std;

ifstream in("ubuntzei.in");
ofstream out("ubuntzei.out");

const int INF = 0x3f3f3f3f3f3f3f3f;

int n, m, k, ans = INF;
int adjMat[2010][2010], loc[20], hamilton[262144][18];
vector<vector<pair<int, int>>> adj;

void royFloyd()
{
    for(int x = 1; x <= n; x++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                adjMat[i][j] = min(adjMat[i][j], adjMat[i][x] + adjMat[x][j]);
}

void buildHamilton()
{
    adj.resize(k + 3);

    for(int i = 0; i <= k; i++)
        for(int j = 0; j <= k; j++)
            if(i != j)
                adj[i].push_back({j, adjMat[loc[i]][loc[j]]});

    for(int i = 1; i < (1 << (k + 1)); i++)
        for(int j = 0; j <= k; j++)
            hamilton[i][j] = INF;

    for(int i = 0; i <= k; i++)
        hamilton[(1 << i)][i] = 0;

    for(int i = 1; i < (1 << (k + 1)); i++)
        for(int j = 0; j <= k; j++)
            if(i & (1 << j))
                for(auto it: adj[j])
                    if(i & (1 << it.first))
                        hamilton[i][j] = min(hamilton[i][j], hamilton[(i ^ (1 << j))][it.first] + it.second);
}

int main()
{
    in >> n >> m >> k;

    for(int i = 1; i <= k; i++)
        in >> loc[i];

    loc[0] = 1;
    loc[k + 1] = n;

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            if(i != j)
                adjMat[i][j] = INF;

    for(int i = 1; i <= m; i++)
    {
        int x, y, cost;
        in >> x >> y >> cost;

        adjMat[x][y] = cost;
        adjMat[y][x] = cost;
    }

    royFloyd();

    buildHamilton();

    for(int i = 0 ; i <= k; i++)
        ans = min(ans, hamilton[(1 << (k + 1)) - 1][i] + adjMat[loc[i]][n]);

    out << ans << '\n';

    return 0;
}