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<vector>
#define pb push_back
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define INF 1e11
using namespace std;
typedef pair<int,long long> pil;

int main(){
	int v,e,s,t,w;
	cin>>v>>e;
	long long mincost[v];
	vector<pil> vec[v];
	bool used[v];
	long long ans=0;
	fill(mincost,mincost+v,INF);
	fill(used,used+v,false);
	rep(i,e){
		cin>>s>>t>>w;
		vec[s].pb(pil(t,w));
		vec[t].pb(pil(s,w));
	}
	mincost[0]=0;
	while(1){
		int next=-1;
		for(int u=0;u<v;u++){
			if(!used[u]&&(next==-1||mincost[u]<mincost[next]))next=u;
		}
		if(next==-1)break;
		used[next]=true;
		ans+=mincost[next];
		for(int i=0;i<vec[next].size();i++){
			mincost[vec[next][i].first]=min(mincost[vec[next][i].first],vec[next][i].second);
		}
	}
	cout<<ans<<endl;
	return 0;
}