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 long long int ll;
typedef pair<ll,ll> mp;
#define inf 1e9


int main(){
	int v,e;
	cin>>v>>e;
	vector<vector<mp> > g(v);
	for(int i=0;i<e;i++){
		int s,t,d;
		cin>>s>>t>>d;
		g[s].push_back(mp(d,t) );
		g[t].push_back(mp(d,s) );
	}
	vector<bool > used(v,false);
	used[0] = true;
	priority_queue<mp,vector<mp>,greater<mp> > q;
	for(int i=0;i<g[0].size();i++)q.push( g[0][i] );
	ll ans =0;
	while(!q.empty() ){
		mp now = q.top();
		q.pop();
		ll nn = now.second;
		ll cost = now.first;
		if(used[nn])continue;
		ans += cost;
		used[nn] = true;
		for(int i=0;i<g[nn].size();i++){
			q.push(g[nn][i]);
		}
	}
	cout<<ans<<endl;
	return 0;
}