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;
int n,m;
struct point{
	int u,v,w;
	bool operator<(const point& p)const{
		return w>p.w;
	}
};
int f[1000005];
int find(int x){
	return x==f[x]?x:f[x]=find(f[x]);
}
void join(int x,int y){
	int fx=find(x);
	int fy=find(y);
	if(fx!=fy)f[fx]=fy;
}
int main(){
	cin>>n>>m;
	for(int i=0;i<=n;i++)f[i]=i;
	int u,v,w;
	priority_queue<point>q;
	while(m--){
		cin>>u>>v>>w;
		q.push({u,v,w});
	}
	int k=1;
	int res=0;
	while(k!=n){
		point p=q.top();q.pop();
		if(find(p.u)!=find(p.v)){
			join(p.u,p.v);
			res+=p.w;
			k++;
		}
	}
	cout<<res<<endl;
	return 0;
}