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;
struct node{
	int u,v,dis;
}edge[2000005];
long long n,m,ans=0;
int f[50005];
int rk[50005];
int num=1;
void init()
{
	for(int i=1;i<=n;i++)
	{
		f[i]=i;
		rk[i]=0;
	}
}
int find(int x)
{
	if(f[x]!=x) f[x]=find(f[x]);
	return f[x];
}
void Union(int a,int b)
{
	int u=find(a),v=find(b);
	if(u==v) return;
	if(rk[u]>rk[v]) f[v]=u;
	else f[u]=v;
	if(rk[u]==rk[v]) rk[v]++;
}
bool cmp(node a,node b)
{
	if(a.dis<b.dis) return true;
	else return false;
}
void Kruskal()
{
	sort(edge,edge+m,cmp);
	for(int i=0;i<m&&num<n;i++)
	if(find(edge[i].u)!=find(edge[i].v))
	{
		Union(edge[i].u,edge[i].v);
		ans+=edge[i].dis;
		num++;
	}
}
int main()
{
	cin>>n>>m;
	init();
	for(int i=0;i<m;i++)
	scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].dis);
	Kruskal();
	if(num<n) cout<<"orz";
	else cout<<ans<<endl;
}