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>
#include<queue>
using namespace std;
static int MIN = 100001;
class Point {
public:
	int a;
	int lenth;
	Point(int a, int b) :a(a), lenth(b) {};
};
struct cmp
{
	bool operator() (Point a, Point b) {
		return a.lenth > b.lenth;
	}
};
vector<Point>v[100001];
priority_queue<Point,vector<Point>,cmp>p;
int visited[100001];
int n;
int m;
long long all = 0;
void dfs(int root) {
		visited[root] = 1;
		for (int i = 0; i < v[root].size(); i++) {
			int key = v[root][i].a;
			if (!visited[key]) {
				p.push(v[root][i]);
			}
		}
		while (!p.empty()) {
			int key = p.top().a;
			int len = p.top().lenth;
			p.pop();
			if (visited[key]) continue;
			visited[key] = 1;
			all += len;
			for (int i = 0; i < v[key].size(); i++) {
				int key_2 = v[key][i].a;
				if (!visited[key_2]) {
					p.push(v[key][i]);
				}
			}
		}
}
void solve() {
	dfs(0);
	cout << all << endl;
}
int main(void) {
	cin >> n>>m;
	int a, b, c;
	for (int i = 0; i < m; i++) {
		cin >> a >> b >> c;
		v[a].push_back(Point(b, c));
		v[b].push_back(Point(a, c));
	}
	solve();
}