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 <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define INF 10000000
#define INF_LL 1e18
#define REP(i, n) for(int i = 0;i < (n);i++)
#define all(n) n.begin(),n.end()

using namespace std;

using ll = long long;
using PII = pair<int, int>;

int main(void){
	int V, E, r;
	cin >> V >> E;
	vector<PII> G[10000];
	ll d[10000];
	fill(d, d+10000, INF_LL);
	ll res = 0;
	REP(i, E){
		int a, b, c;
		cin >> a >> b >> c;
		G[a].push_back(PII(c, b));
		G[b].push_back(PII(c, a));
	}
	priority_queue<PII, vector<PII>, greater<PII> > que;
	que.push(PII(0, 0));
	while(que.size()){
		PII p = que.top();que.pop();
		int v = p.second;
		if(d[v] != INF_LL) continue;
		res += p.first;
		d[v] = 1;
		REP(i, G[v].size()){
			que.push(PII(G[v][i].first, G[v][i].second));
		}
	}
	cout << res << endl;
	return 0;
}