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:
//be name khoda
//Pedram Sadeghian
// :)
#include <bits/stdc++.h>
using namespace std;

const int maxN = 1e5;
int n, m, k1, k2, dad[maxN], high[maxN], ans;
pair <int, pair <int, int> > P[maxN]; 
int root(int a){
	if (dad[a] == a)
		return a;
	dad[a] = root(dad[a]);
	return dad[a];
}
void merrge(int a, int b){
	if (high[root(a)] > high[root(b)])
		swap(a, b);
	int newhigh = high[root(b)];
	if (high[root(a)] == high[root(b)])
		newhigh++;
	dad[root(a)] = root(b);
	high[root(a)] = newhigh;
	return ;
}
int main(){
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for (int i = 0 ; i < m ; i++){
		cin >> k1 >> k2 >> P[i].first;
		P[i].second.first = k1;
		P[i].second.second = k2;
	}
	sort(P, P + m);
	for (int i = 0 ; i < n ; i++){
		dad[i] = i;
		high[i] = 1;
	}
	for (int i = 0 ; i < m ; i++){
		 if (root(P[i].second.first) != root(P[i].second.second)){
		 	ans += P[i].first;
		 	merrge(P[i].second.first, P[i].second.second);
		 }
	}
	cout << ans << endl;
}