/* -*- coding: utf-8 -*-
 *
 * 748.cc:  No.748 yuki国のお財布事情 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_M = 100000;
const long long LINF = 1LL << 61;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef queue<int> qi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef stack<int> si;

struct Edge {
  int i, u, v, c;
  Edge() {}
  Edge(int _i, int _u, int _v, int _c): i(_i), u(_u), v(_v), c(_c) {}
  bool operator<(const Edge &e) const { return c < e.c; }
};

struct UFT {
  int links[MAX_N], ranks[MAX_N], sizes[MAX_N];
  UFT() {}

  void clear(int n) {
    for (int i = 0; i < n; i++) links[i] = i, ranks[i] = sizes[i] = 1;
  }

  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }

  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }

  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};

/* global variables */

Edge es[MAX_M];
bool kps[MAX_M];
UFT uft;

/* subroutines */

/* main */

int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);

  for (int i = 0; i < m; i++) {
    int u, v, c;
    scanf("%d%d%d", &u, &v, &c);
    u--, v--;
    es[i] = Edge(i, u, v, c);
  }
  sort(es, es + m);

  for (int i = 0; i < k; i++) {
    int ei;
    scanf("%d", &ei);
    ei--;
    kps[ei] = true;
  }

  uft.clear(n);

  ll sum = 0;
  for (int i = 0; i < m; i++) {
    Edge &e = es[i];
    if (kps[e.i] && ! uft.same(e.u, e.v)) uft.merge(e.u, e.v);
  }

  for (int i = 0; i < m; i++) {
    Edge &e = es[i];
    if (! uft.same(e.u, e.v))
      uft.merge(e.u, e.v);
    else if (! kps[e.i])
      sum += e.c;
  }

  printf("%lld\n", sum);
  return 0;
}