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;

#define N 10005

int n, m;
int fa[N];
int ans(0);

int find(int u)
{
	return fa[u] == u ? u : fa[u] = find(fa[u]);
}

struct edge
{
	int x, y, w;
	edge(void) {};
	edge(int a, int b, int c) :
		x(a), y(b), w(c) {};
	friend bool operator < (const edge &a, const edge &b)
	{
		return a.w > b.w;
	}
};

priority_queue<edge> pq;

signed main(void)
{
	cin >> n >> m;
	for (int x, y, w; m--; )
	{
		cin >> x >> y >> w;
		pq.push(edge(x, y, w));
	}
	for (int i = 0; i < n; ++i)
		fa[i] = i;
	while (!pq.empty())
	{
		edge t = pq.top(); pq.pop();
		if (find(t.x) != find(t.y))ans += t.w,
			fa[find(t.x)] = find(t.y);
	}
	cout << ans << endl;
}