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;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
typedef long long ll;

struct edge{
	int u,v;
	ll cost;
};

bool comp(const edge& e1, const edge& e2){
	return e1.cost < e2.cost;
}

int main(){
	ll V,E;
	cin >> V >> E;
	vector<edge> e;
	vector<int> c;
	rep(i,V){
		c.push_back(i);
	}
	rep(i,E){
		int s,t;
		ll w;
		cin >> s >> t >> w;
		edge e1 = {s,t,w};
		e.push_back(e1);
	}
	sort(e.begin(),e.end(),comp);
	
	ll ans = 0;
	
	rep(i,E){
		if(c[e[i].u] != c[e[i].v]){
			ans += e[i].cost;
			int temp = c[e[i].v];
			rep(j,V){
				if(c[j] == temp){
					c[j] = c[e[i].u];
				}
			}
		}
	}
	
	cout << ans << endl;
    return 0;
}