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

using namespace std;

ifstream f ("team.in");
ofstream g ("team.out");

const int INF = (1 << 30);
const int NMAX = 500 + 1, PMAX = 50 + 1;

int p, n, m, l;
int destinatie[PMAX];
bool inQ[NMAX];
int d[PMAX][NMAX];
vector < pair <int, int> > graf[NMAX];

int dp[NMAX][NMAX][NMAX];
char s[100];

int get_number(int &i) {
    int x = 0;
    while (i < l && isdigit(s[i]))
        x = x * 10 + s[i] - '0',
        i++;
    return x;
}

void citeste() {
    f >> p >> n >> m;
    int a, b, c;
    f.getline(s, 99);
    int j;
    for (int i = 1; i <= m; i++) {
        f.getline(s, 99);
        l = strlen(s);
        j = 0;
        a = get_number(j);
        j++;
        b = get_number(j);
        j++;
        c = get_number(j);
        graf[a].push_back(make_pair(b, c));
        graf[b].push_back(make_pair(a, c));
    }

    for (int i = 1; i <= p; i++) f >> destinatie[i];
}


//Dijkstra e prea mainstream
void bellman_ford(int sursa, int sol[]) {
    int costcrt, nod, nod2, l, c;
    queue <int> Q;

    for (int i = 1; i <= n; i++) sol[i] = INF;
    sol[sursa] = 0;
    Q.push(sursa);
    inQ[sursa] = true;

    while (Q.size() > 0) {
        nod = Q.front();
        Q.pop();
        inQ[nod] = false;
        costcrt = sol[nod];
        l = graf[nod].size();
        for (int i = 0; i < l; i++) {
            nod2 = graf[nod][i].first;
            c = graf[nod][i].second;
            if (sol[nod2] > costcrt + c) {
                sol[nod2] = costcrt + c;
                if (!inQ[nod2]) {
                    Q.push(nod2);
                    inQ[nod2] = true;
                }
            }
        }
    }
}

void rezolva() {
//Bellman Ford ftw
    for (int i = 1; i <= p; i++) bellman_ford(destinatie[i], d[i]);

    int j;
    int min1, min2;
    min1 = min2 = INF;
    for (int lg = 2; lg <= p; lg++) {
        for (int i = 1; i <= p; i++) {
            j = i + lg - 1;
            if (j > p) break;
            for (int k = i; k <= j; k++) {
                min1 = min2 = INF;
                for (int a = i; a <= k - 1; a++)
                    min1 = min(min1, dp[i][k - 1][a] + d[a][destinatie[k]]);

                for (int a = k + 1; a <= j; a++)
                    min2 = min(min2, dp[k + 1][j][a] + d[a][destinatie[k]]);
                if (min1 == INF) min1 = 0;
                if (min2 == INF) min2 = 0;
                dp[i][j][k] = min1 + min2;
            }
        }
    }

    int sol = INF;
    for (int i = 1; i <= p; i++)
        sol = min(sol, dp[1][p][i] + d[i][1]);
    g << sol;
}


int main() {
    citeste();
    rezolva();
    return 0;
}