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 edge { int s, t, c; };
bool compare(const edge& e1, const edge& e2) {
	return e1.c < e2.c;
}
int V, E, par[10009]; edge e[100009];
int root(int x) {
	if(par[x] == x) return x;
	return par[x] = root(par[x]);
}
void unite(int x, int y) {
	x = root(x);
	y = root(y);
	par[x] = y;
}
bool same(int x, int y) {
	return root(x) == root(y);
}
int main() {
	scanf("%d%d", &V, &E);
	for(int i = 0; i < E; i++) scanf("%d%d%d", &e[i].s, &e[i].t, &e[i].c);
	sort(e, e + E, compare);
	int ret = 0;
	for(int i = 0; i < V; i++) par[i] = i;
	for(int i = 0; i < E; i++) {
		if(!same(e[i].s, e[i].t)) {
			ret += e[i].c;
			unite(e[i].s, e[i].t);
		}
	}
	printf("%d\n", ret);
	return 0;
}