#include"bits/stdc++.h"

using namespace std; 

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;

#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) int((a).size())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ROF(i,a,b) for(int i=(b-1);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int LARGE_INT = 1e9+100;
const int INF = 2e9+100;
const LL INF_LL = (LL)INF*(LL)INF;
const int MOD = 1e9+7;

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

LL modpow(LL a, LL n) {
    LL res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
}

void Main()
{
    int n,m,r;cin>>n>>m>>r;
    VI a(r);
    REP(i,r){
        cin>>a[i];
        a[i]--;
    }

    vector<VVI> e(n);
    REP(i,m){
        int x,y,c;cin>>x>>y>>c;
        x--;
        y--;
        e[x].PB({y,c});
        e[y].PB({x,c});
    }

    VVL dist(r);
    REP(i,r){
        dist[i].resize(r);
    }

    REP(i,r){
        VL v(n,INF_LL);
        PQ_ASC_VL pq;
        pq.push({0,a[i]});
        //v[a[i]]=0;
        while(!pq.empty()){
            LL d = pq.top()[0];
            LL now = pq.top()[1];
            pq.pop();

            if(v[now]!=INF_LL){
                continue;
            }
            v[now]=d;
            REP(j,r){
                if(now==a[j]){
                    dist[i][j] = d;
                }
            }

            for(auto x : e[now]){
                LL next = x[0];
                LL nd = d + x[1];
                if(v[next] <= nd){
                    continue;
                }
                pq.push({nd,next});
            }
        }
    }

    vector<VVL> dp(r);
    REP(i,r){
        dp[i].resize(1<<r);
        REP(j,1<<r){
            dp[i][j].resize(r,INF_LL);
        }
    }

    REP(i,r){
        dp[0][1<<i][i]=0;
    }

    FOR(i,1,r){
        REP(bit,(1<<r)){
            if(bitset<32>(bit).count() != i){
                continue;
            }
            REP(j,r){
                if(bit&(1<<j)){
                    continue;
                }
                REP(k,r){
                    if(!(bit&(1<<k))){
                        continue;
                    }
                    dp[i][bit+(1<<j)][j] = min(dp[i][bit+(1<<j)][j], dp[i-1][bit][k] + dist[k][j]);
                }
            }
        }
    }

    LL result = INF_LL;
    REP(i,r){
        result = min(result, dp[r-1][(1<<r)-1][i]);
    }
    
    cout<<result<<endl;
    
	return;
}

int main()
{
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(15);
	Main();
    return 0;
}

Measured memory_bytes: 4136