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 <algorithm>
#include <utility>

using namespace std;

class unionfind {
private:
	int* parent;
public:
	unionfind(int nodes) {
		parent = new int[nodes];
		for(int i = 0;i < nodes;i++) parent[i] = -1;
	}
	~unionfind() {
		delete parent;
	}
	int root(int n) {
		if(parent[n] == -1) return n;
		int res = root(parent[n]);
		parent[n] = res;
		return res;
	}
	bool same(int a,int b) {
		return root(a) == root(b);
	}
	void merge(int a,int b) {
		parent[root(a)] = root(b);
	}
};

int main(void) {
	int v,e,s,t,w;
	cin >> v >> e;
	vector<pair<int,pair<int,int>>> path;
	for(int i = 0;i < e;i++) {
		cin >> s >> t >> w;
		path.push_back(make_pair(w,make_pair(s,t)));
	}
	sort(path.begin(),path.end());
	int res = 0;
	unionfind u = unionfind(v);
	for(auto& e:path) {
		if(!u.same(e.second.first,e.second.second)) {
			res += e.first;
			u.merge(e.second.first,e.second.second);
		}
	}
	cout << res << endl;
}