#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9,MOD = 1e9+7,ohara = 1e6;
const ll LINF = 1e18;
using namespace std;

#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl

ll n,cnt=0,ans=0,a[ohara],b[ohara],c[ohara],d,cmp,cmpp,m,h,w,x,y,sum=0,pos,k;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};

//-------------------------↓↓↓↓↓↓------------------------

int main(void){
       cin.tie(0);
    ios::sync_with_stdio(false);
      
    cin>>n>>m>>k;
    pair<ll,pair<ll,ll>> p[ohara];
    map<ll,ll> hen;
    map<ll,ll> out;
    ll henn=0;
    rep(i,m){
        cin>>a[i]>>b[i]>>c[i];
        hen[a[i]]++;
        hen[b[i]]++;
    }
    rep(i,k){
        cin>>d;
        out[d-1]=1;
    }
    henn=m;
    rep(i,m){
        if(out[i]==1)continue;
        p[cnt++]=make_pair(c[i],make_pair(a[i],b[i]));
    }
    sort(p,p+cnt);
    reverse(p,p+cnt);
    rep(i,cnt){
        if(henn+1==n)break;
        ll from,to;
        from=p[i].second.first;
        to=p[i].second.second;
        if(hen[from]-1<=0||hen[to]-1<=0)continue;
        hen[from]--;
        hen[to]--;
        ans+=p[i].first;
        henn--;
    }
    Cout(ans);
    return 0;
}