#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <complex>
#include <atcoder/dsu>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T> &a){
  for(auto &i:a)is>>i;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
struct E{
  int u,v,cost;
};
bool comp(E a,E b){
  return a.cost<b.cost;
}
int main(){
  int n,m,k;
  cin>>n>>m>>k;
  vector<E>edge(m);
  rep(i,m){
    int a,b,c;
    cin>>a>>b>>c;
    a--,b--;
    edge[i]={a,b,c};
  }
  dsu uf(n);
  ll ans=0;
  rep(i,k){
    int e;
    cin>>e;
    e--;
    uf.merge(edge[e].u,edge[e].v);
    ans-=edge[e].cost;
  }
  sort(all(edge),comp);
  for(auto [u,v,cost]:edge){
    if(uf.same(u,v))ans+=cost;
    else uf.merge(u,v);
  }
  cout<<ans<<endl;
}