#include<iostream>
#include<vector>
#include<algorithm>
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});
  }

  int mask=0;
  rep(_, k){
    int i; cin>> i;
    i--;
    mask^=(1<<i);
  }

  i64 mx=0;
  for(i64 bit=0; bit<(1LL<<m); bit++){
    if((bit&mask)!=mask) continue;
    i64 sub=0;
    UnionFind uf(n);
    rep(i, m){
      if(bit&(1<<i)){
        uf.unite(edges[i].u, edges[i].v);
      }else{
        sub+=edges[i].cost;
      }
    }
    bool con=true;
    int root=uf.find(0);
    rep(i, n) con&=(root==uf.find(i));
    if(con) mx=max(mx, sub);
  }

  cout<< mx<< endl;
  return 0;
}