#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
using namespace std;

#define rep(i,n) for(int i=0;i<(n);i++)

struct UnionFind{
  vector<int> par;
  UnionFind(int n){
    par.resize(n);
    rep(i, n) par[i]=i;
  }
  int find(int i){
    return par[i]==i ? par[i] : (par[i]=find(par[i]));
  }
  void unite(int i, int j){
    par[find(i)]=find(j);
  }
  bool same(int i, int j){
    return find(i)==find(j);
  }
};

using i64=long long;
struct Edge{
  int u, v;
  i64 cost;
  Edge(int u, int v, i64 c):u(u), v(v), cost(c){};
};

int main(){

  int n, m, k; cin>> n>> m>> k;

  vector<Edge> edges;
  rep(_, m){
    int a, b; i64 c;
    cin>> a>> b>> c;
    edges.push_back(Edge{a-1, b-1, c});
  }

  i64 sum=0;
  UnionFind uf(n);
  rep(_, k){
    int i; cin>> i;
    i--;
    uf.unite(edges[i].u, edges[i].v);
    sum+=edges[i].cost;
  }
  sort(edges.begin(), edges.end(), [&](const Edge &l, const Edge &r){
    return l.cost<r.cost;
  });
  for(auto e: edges){
    if(uf.same(e.u, e.v)==false){
      uf.unite(e.u, e.v);
      sum+=e.cost;
    }
  }
  
  auto tot=accumulate(edges.begin(), edges.end(), 0LL, [&](i64 res, const Edge &e){
    return res+e.cost;
  });
  cout<< tot-sum<< endl;

  return 0;
}