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;
typedef pair<int,pair<int,int> >Piii;

int par[111111];
int rnk[111111];
int n,m;

int root(int a){
	return par[a]!=a?root(par[a]):a;
}

void unite(int a,int b){
	if(rnk[a]>rnk[b]) swap(a,b);
	par[root(a)] =  root(b);
	rnk[root(b)] += rnk[root(a)];
}

Piii v[100000];

int main(){
	for(int i=0;i<111111;i++)par[i]=i;
	cin>>n>>m;
	for(int i=0;i<m;i++){
		int a,b,c;
		cin>>a>>b>>c;
		v[i]=make_pair(c,make_pair(a,b));
	}
	sort(v,v+m);

	int sum=0;

	for(int i=0;i<m;i++){
		int A=v[i].second.first;
		int B=v[i].second.second;
		if(root(A)==root(B)) continue;
		sum += v[i].first;
		unite(A,B);
	}

	cout<<sum<<endl;
}