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;

int main() {
	int V, E;
	cin >> V >> E;
	vector<vector<pair<int, int>>> G(V, vector<pair<int, int>>());
	for (int i=0;i<E;i++) {
		int s, t, w;
		cin >> s >> t >> w;
		pair<int, int> p_1 = make_pair(t, w);
		pair<int, int> p_2 = make_pair(s, w);
		G[s].push_back(p_1);
		G[t].push_back(p_2);
	}

	priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
	pair<long long, int> first = make_pair(0LL, 0);
	pq.push(first);
	vector<bool> visited(V, false);
	long long ans = 0LL;
	while (!pq.empty()) {
		pair<long long, int> rem = pq.top();
		pq.pop();
		if (visited[rem.second]) continue;
		visited[rem.second] = true;
		ans += rem.first;
		for (auto p : G[rem.second]) {
			if (visited[p.first]) continue;
			pair<long long, int> tmp = make_pair(p.second, p.first);
			pq.push(tmp);
		}
	}

	cout << ans << endl;
}