Problem: Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).

Constraints

* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph is connected
* There are no parallel edges
* There are no self-loops

Input


|V| |E|
s0 t0 w0
s1 t1 w1
:
s|E|-1 t|E|-1 w|E|-1


, where |V| is the number of vertices and |E| is the number of edges in the graph. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively.

si and ti represent source and target verticess of i-th edge (undirected) and wi represents the weight of the i-th edge.

Output

Print the sum of the weights of the Minimum Spanning Tree.

Examples

Input

4 6
0 1 2
1 2 1
2 3 1
3 0 1
0 2 3
1 3 5


Output

3


Input

6 9
0 1 1
0 2 3
1 2 1
1 3 7
2 4 1
1 4 3
3 4 1
3 5 1
4 5 6


Output

5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 10005
#define INF 1e18
#define MOD 1000000007

using namespace std;
typedef long long int ll;
typedef pair <int,int> P;

typedef tuple <ll,int,int> T;
struct edge{int to;ll cost;};
vector<edge> G[SIZE],M[SIZE];
bool used[SIZE];

//0_indexed
ll prim(){
  priority_queue<T,vector<T>,greater<T>> que;
  fill(used,used+SIZE,false);
  rep(i,0,SIZE) M[i].clear();
  ll res = 0;
  que.push(T(0,0,0));
  while(!que.empty()){
    T t = que.top();que.pop();
    ll l = get<0>(t);
    int v = get<1>(t);
    int from = get<2>(t);
    if(used[v])continue;
    res += l;
    used[v] = true;
    M[v].push_back((edge){from,l});
    M[from].push_back((edge){v,l});
    for(edge u : G[v]){
      if(!used[u.to])que.push(T(u.cost,u.to,v));
    }
  }
  return res;
}

void add_edge(int a,int b,ll c){
  G[a].push_back((edge){b,c});
  G[b].push_back((edge){a,c});
}

int V,E;

int main(){
  cin >> V >> E;
  rep(i,0,E){
    int s,t;
    ll w;
    cin >> s >> t >> w;
    add_edge(s,t,w);
  }

  cout << prim() << endl;

  return 0;
}