#include <bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint,int> P1;
typedef pair<int,pint> P2;
typedef pair<pint,pint>PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD=1000000007;
const ll INF=1e18;
int dx[]={0,0,1,-1};
int dy[]={-1,1,0,0};

int N,M,K;
vector<P2> v;
struct UF{
    vector<int>par,sz;
    void init(int n){
        par.resize(n);
        sz.resize(n);
        for(int i=0;i<n;i++){
            par[i]=i;
            sz[i]=1;
        }
    }
    int find(int x){
        return x==par[x]?x:par[x]=find(par[x]);
    }
    void unite(int x,int y){
        x=find(x);y=find(y);
        if(x==y)return;
        sz[x]+=sz[y];
        par[y]=x;
    }
    bool same(int x,int y){
        return find(x)==find(y);
    }
    int size(int x){
        return sz[find(x)];
    }
};
signed main(){
    cin.tie(0);
	ios::sync_with_stdio(false);
    cin>>N>>M>>K;
    rep(i,0,M){
        int a,b,c;
        cin>>a>>b>>c;
        a--;b--;
        v.pb(P2(c,pint(a,b)));
    }
    int ans=0;
    UF uf;
    uf.init(N+1);
    rep(i,0,K){
        int x;cin>>x;x--;
        uf.unite(v[x].se.fi,v[x].se.se);
        ans-=v[x].fi;
    }
    sort(all(v));
    
    for(auto e:v){
        P2 p=e;
        if(!(uf.same(p.se.fi,p.se.se))){
            uf.unite(p.se.fi,p.se.se);
        }else{
            ans+=p.fi;
            //cout<<p.se.se<<endl;
        }
    }
    cout<<ans<<endl;
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    return 0;
}