#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,-1,0,1,1,1,-1,-1,0};
const ll dx[9]={-1,0,1,0,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
void solve(ll n,ll m,ll t){
    vvpl g(n);
    rep(i,m){
        ll a,b,c;cin >> a >> b >> c;a--;b--;
        g[a].emplace_back(pl(b,c));
        g[b].emplace_back(pl(a,c));
    }
    vvl dp(1<<t,vl(n,INF));
    rep(i,t){
        ll x;cin >> x;x--;
        dp[1<<i][x]=0;
    }
    for(ll i=1;i<(1<<t);i++){
        for(ll j=0;j<n;j++){
            for(ll k=i;k>=0;k--){
                k&=i;
                chmin(dp[i][j],dp[k][j]+dp[i^k][j]);
            }
        } 
        priority_queue<pl,vpl,greater<pl>> que;
        rep(j,n)que.push({dp[i][j],j});
        while(que.size()){
            auto [dist,v]=que.top();que.pop();
            if(dist>dp[i][v])continue;
            for(auto [to,cost]:g[v]){
                if(dist+cost<dp[i][to]){
                    chmin(dp[i][to],dist+cost);
                    que.push({dp[i][to],to});
                }
            }
        }
    }
    ll ans=INF;
    rep(i,n)chmin(ans,dp.back()[i]);
    cout << ans << endl;
}
struct UnionFind {
    vector<int> par;
    vector<int> edge;
    
    UnionFind(int n) : par(n, -1),edge(n, 0) {}

    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) {
            edge[x]++;
            return false;
        }
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        edge[x] += edge[y]+1;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
};
struct edge{
    ll u,v,cost;
    bool operator<(edge &g){
        return cost<g.cost;
    }
};
void solve2(ll n,ll m,ll t){
    vector<edge> ed(m);
    rep(i,m){
        ll a,b,c;cin >> a >> b >> c;a--;b--;
        ed[i]={a,b,c};
    }
    sort(all(ed));
    vl ex(n);
    rep(i,t){
        ll a;cin >> a;a--;ex[a]++;
    }
    vl ord,ter;
    rep(i,n){
        if(!ex[i])ord.emplace_back(i);
    }
    ll ans=INF;
    rep(bit,1<<ord.size()){
        ll ret=0;
        vl use=ex;
        rep(i,ord.size())if(bit>>i&1)use[ord[i]]++;
        UnionFind uf(n);
        ll cnt=0;
        for(auto [u,v,cost]:ed){
            if(!use[u])continue;
            if(!use[v])continue;
            if(uf.same(u,v))continue;
            uf.merge(u,v);cnt++;ret+=cost;
        }
        if(cnt+1==__builtin_popcount(bit)+t)chmin(ans,ret);
    }
    cout << ans << endl;
}
int main(){
    ll n,m,t;cin >> n >> m >> t;
    if(t<=15){
        solve(n,m,t);
    }
    else{
        solve2(n,m,t);
    }
}