#include <bits/stdc++.h>

using namespace std;

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

vector <pair <int, int>> g[2001];

int n, m;

int k;

int pr[2001], prx[2001];

int fre[2001];

int dist[2001];

struct compara
{
    bool operator()(int l, int c)
    {
        return dist[l] >= dist[c];
    }
};

priority_queue <int, vector <int>, compara> pq;

void dijkstra(vector <pair <int, int>> g[2001], int start)
{
    for(int i = 1; i <= n; i++)
    {
        dist[i] = 1e9;
    }
    dist[start] = 0;
    pq.push(start);
    fre[start] = 1;
    while(!pq.empty())
    {
        int curent = pq.top();
        pq.pop();
        fre[curent] = 0;
        for(int i = 0; i < g[curent].size(); i++)
        {
            int vecin = g[curent][i].first;
            int cost = g[curent][i].second;
            if(dist[curent] + cost < dist[vecin])
            {
                dist[vecin] = dist[curent] + cost;
                if(fre[vecin] == 0)
                {
                    pq.push(vecin);
                    fre[vecin] = 1;
                }
            }
        }
    }
}

vector <vector <int>> v;

vector <int> trans(vector <int> v, int n)
{
    vector <int> x;
    x.push_back(1);
    for(int i = 0; i < v.size(); i++)
        x.push_back(v[i]);
    x.push_back(n);
    return x;
}

int val(vector <int> v)
{
    int sum = 0;
    for(int i = 0; i < v.size() - 1; i++)
    {
        dijkstra(g, v[i]);
        sum += dist[v[i + 1]];
        memset(fre, 0, sizeof(fre));
        memset(dist,0, sizeof(dist));
    }
    return sum;
}

int main()
{
    in >> n >> m;
    in >> k;
    for(int i = 1; i <= k; i++)
        in >> pr[i], prx[i] = pr[i];
    for(int i = 1; i <= m; i++)
    {
        int l, c, cost;
        in >> l >> c >> cost;
        g[l].push_back({c, cost});
        g[c].push_back({l, cost});
    }
    do
    {
        vector <int> a;
        for(int i = 1; i <= k; i++)
            a.push_back(pr[i]);
        v.push_back(trans(a, n));
    }while(prev_permutation(pr + 1, pr + k + 1));
    do
    {
        vector <int> a;
        for(int i = 1; i <= k; i++)
            a.push_back(prx[i]);
        v.push_back(trans(a, n));
    }while(next_permutation(prx + 1, prx + k + 1));
    int minim = 1e9;
    for(int i = 0; i < v.size(); i++)
    {
        minim = min(minim, val(v[i]));
    }
    out << minim;
    return 0;
}