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>
using namespace std;
#define ll long long
const ll MOD=1000000007;
const long double PI=3.14159265358979;

struct UnionFind{
  vector<int> par;
  
  UnionFind(int N){
    vector<int> a(N);
    par=a;
    for(int i=0;i<N;i++){
      par[i]=i;
    }
  }
  
  int root(int x){
    if(x==par[x]){
      return x;
    }
    return root(par[x]);
  }
  
  void unite(int x,int y){
    if(root(x)==root(y)){
      return;
    }
    par[root(x)]=root(y);
    return;
  }
  
  bool same(int x,int y){
    return root(x)==root(y);
  }
};


int main(){
  ll V,E;
  cin>>V>>E;
  //vector<tuple<ll,ll,ll>> e(E);
  priority_queue<tuple<ll,ll,ll>, vector<tuple<ll,ll,ll>>, greater<tuple<ll,ll,ll>>> q;

  for(int i=0;i<E;i++){
    ll a,b,c;
    cin>>a>>b>>c;
    tuple<ll,ll,ll> e(c,b,a);
    q.push(e);
  }
  UnionFind tree(V);
  ll ans=0;
  while(!q.empty()){
    tuple<ll,ll,ll> e1=q.top();
    int a=get<2>(e1),b=get<1>(e1);
    if(!tree.same(a,b)){
      ans+=get<0>(e1);
      tree.unite(a,b);
    }
    q.pop();
  }
  cout<<ans<<endl;
    
    
}