#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "team";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

typedef long long int lld;
typedef pair<int, int> PII;
typedef pair<int, lld> PIL;
typedef pair<lld, int> PLI;
typedef pair<lld, lld> PLL;

const int INF = (1LL << 29) - 1;
const lld LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};

int N, M, P;
int DP[55][55][505];
bool viz[55][55][505];
int C[505][505];
int dest[55];

int solve(int i, int j, int x) {
    if(i == j)
        return C[x][dest[i]];

    if(i > j)
        return INF;

    if(viz[i][j][x])
        return DP[i][j][x];

    int k, ans = INF;

    for(k = i; k <= j; k++)
        ans = min(ans, solve(i, k - 1, dest[k]) + solve(k + 1, j, dest[k]) + C[x][dest[k]]);

    viz[i][j][x] = 1;
    DP[i][j][x] = ans;

    return DP[i][j][x];
}

int main() {
    int i, j, k, x, y, z;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d%d", &P, &N, &M);

    for(i = 1; i <= N; i++)
        for(j = 1; j <= N; j++)
            if(i != j)
                C[i][j] = INF;

    while(M--) {
        scanf("%d%d%d", &x, &y, &z);
        C[x][y] = C[y][x] = z;
    }

    for(i = 1; i <= P; i++)
        scanf("%d", &dest[i]);

    for(k = 1; k <= N; k++)
        for(i = 1; i <= N; i++)
            for(j = 1; j <= N; j++)
                if(i != j && i != k && j != k)
                    C[i][j] = min(C[i][j], C[i][k] + C[k][j]);

    printf("%d\n", solve(1, N, 1));

    return 0;
}