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<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

const int INF = 1000000000;

struct edge{int to,cost;};
typedef pair<int,int> P;
int v,e;
vector<edge> G[10000];
bool used[10000];
int ans = 0;
priority_queue<P,vector<P>,greater<P> > q;

int main(){
  scanf("%d %d",&v,&e);
  for(int i=0;i<e;i++){
    int s,t,d;
    scanf("%d %d %d",&s,&t,&d);
    edge e;
    e.cost = d;
    e.to = t;
    G[s].push_back(e);
    e.to = s;
    G[t].push_back(e);
  }
  fill(used,used+v,false);
  q.push(P(0,0));
  while(!q.empty()){
    P p = q.top(); q.pop();
    int nv = p.second;
    if(used[nv]) continue;
    ans += p.first;
    used[nv] = true;
    for(int i=0;i<G[nv].size();i++){
      q.push(P(G[nv][i].cost,G[nv][i].to));
    }
  }
  printf("%d\n",ans);
  return 0;
}