#include <bits/stdc++.h>

#define NMAX 2005
#define KMAX 20
#define INF ((1 << 30) - 1)

using namespace std;

typedef pair<int, int> pii;

int n, m, k, c[KMAX], dist1[NMAX], distk[KMAX][NMAX], dp[(int)(1 << 15) + 5][KMAX];
vector<pii> adj[NMAX];

void dij(const int SN, int DIST[]) {
    for(int i = 1; i <= n; ++i)
        DIST[i] = INF;
    DIST[SN] = 0;
    priority_queue<pii, vector<pii>, greater<pii> > pq;
    pq.push({0, SN});
    while(!pq.empty()) {
        const int crt = pq.top().second;
        pq.pop();

        for(const auto &el : adj[crt]) {
            const int elf = el.first, els = el.second;
            if(DIST[elf] > DIST[crt] + els) {
                DIST[elf] = DIST[crt] + els;
                pq.push({DIST[elf], elf});
            }
        }
    }
}

int main()
{
    freopen("ubuntzei.in", "r", stdin);
    freopen("ubuntzei.out", "w", stdout);
    scanf("%d%d%d", &n, &m, &k);
    for(int i = 1; i <= k; ++i)
        scanf("%d", &c[i]);
    for(int x, y, z; m; --m) {
        scanf("%d%d%d", &x, &y, &z);
        adj[x].push_back({y, z});
        adj[y].push_back({x, z});
    }
    dij(1, dist1);
    if(!k) {
        printf("%d", dist1[n]);
        return 0;
    }
    for(int i = 1; i <= k; ++i)
        dij(c[i], distk[i]);
    for(int i = (1 << k); i + 1; --i)
        for(int j = 0; j < k; ++j)
            dp[i][j] = INF;
    for(int i = 0; i < k; ++i)
        dp[1 << i][i] = dist1[c[i + 1]];
    for(int mask = 1; mask < (1 << k); ++mask)
        for(int i = 0; i < k; ++i) {
            if(!(mask & (1 << i))) continue;
            for(int j = 0; j < k; ++j) {
                if(i == j || !(mask & (1 << j))) continue;
                dp[mask][i] = min(dp[mask][i], dp[mask ^ (1 << i)][j] + distk[i + 1][c[j + 1]]);
            }
        }
    int ans = INF;
    for(int i = 0; i < k; ++i)
        ans = min(ans, dp[(1 << k) - 1][i] + distk[i + 1][n]);
    printf("%d", ans);
    return 0;
}