#include using namespace std; #define inf INT_MAX #define INF LLONG_MAX #define ll long long #define ull unsigned long long #define M (int)(1e9+7) #define P pair #define PLL pair #define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++) #define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--) #define rep(i,n) FOR(i,0,n) #define rrep(i,n) RFOR(i,n,0) #define all(a) a.begin(),a.end() #define IN(a,n) rep(i,n){ cin>>a[i]; } const int vx[4] = {0,1,0,-1}; const int vy[4] = {1,0,-1,0}; #define PI 3.14159265 #define F first #define S second #define PB push_back #define EB emplace_back #define int ll #define vi vector template< typename T > struct edge { int src, to; T cost; edge(int to, T cost) : src(-1), to(to), cost(cost) {} edge(int src, int to, T cost) : src(src), to(to), cost(cost) {} edge &operator=(const int &x) { to = x; return *this; } operator int() const { return to; } }; template< typename T > using Edges = vector< edge< T > >; template< typename T > using WG = vector< Edges< T > >; using UG = vector< vector< int > >; template< typename T > using Matrix = vector< vector< T > >; struct UnionFind { vector par; vector sizes; UnionFind(int n) : par(n), sizes(n, 1) { rep(i,n) par[i] = i; } int find(int x) { if (x == par[x]) return x; return par[x] = find(par[x]); } bool unite(int x, int y) { x = find(x); y = find(y); if (x == y) return false; if (sizes[x] < sizes[y]) swap(x, y); par[y] = x; sizes[x] += sizes[y]; return true; } int size(int x) { return sizes[find(x)]; } }; template T kruskal(Edges &es,int n,int k) { UnionFind uf(n); T min_cost = 0; rep(i,k){ int e; cin>>e; e--; min_cost+=es[e].cost; uf.unite(es[e].src,es[e].to); } sort(all(es),[](const edge & a,const edge &b){ return (a.cost < b.cost); }); for(auto &e:es) { if(uf.unite(e.src,e.to)) min_cost += e.cost; } return min_cost; } signed main(){ cin.tie(0); ios::sync_with_stdio(false); int n,m,k; int cost=0; Edges es; cin>>n>>m>>k; rep(i,m){ int a,b,c; cin>>a>>b>>c; a--;b--; cost+=c; es.PB(edge(a,b,c)); } cout<