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 <iostream>
#include <limits.h>
#include <queue>
#define V_MAX 10000
#define INF INT_MAX
using namespace std;

class Edge{
public:
  int to,cost;
  Edge(int t,int c){to=t; cost=c;}
};

typedef pair<int,int> P;

vector<Edge> G[V_MAX+1];
int V,E;
int mincost[V_MAX+1];
bool used[V_MAX+1];

int solve(){

  fill(mincost,mincost+V_MAX+1,INF);
  fill(used,used+V_MAX+1,false);
  
  priority_queue<P,vector<P>,greater<P> > qu;
  int res=0;

  qu.push(P(0,0));
  
  while(!qu.empty()){

    P p=qu.top();
    qu.pop();
    int v=p.second;
    
    if(used[v]) continue;
    used[v]=true;
    res+=p.first;
    
    for(int i=0;i<G[v].size();i++){
      Edge e=G[v][i];
      if(!used[e.to]) qu.push(P(e.cost,e.to));
    }
  }
  return res;
}



int main(){

  
  cin>>V>>E;
  int s,t,c;
  for(int i=0;i<E;i++){
    cin>>s>>t>>c;
    Edge e1(t,c),e2(s,c);
    G[s].push_back(e1);
    G[t].push_back(e2);

  }

  cout<<solve()<<endl;
  
  return 0;
}