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 int long long

#define ll long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define P pair<ll,ll>
#define ld long double
ll INF = (1LL << 60);
int MOD = 1000000007;

struct UnionFind {
	vector<ll>p;
	UnionFind(ll n) {
		p.resize(n, -1);
	}
	ll find(ll x) {
		if (p[x] == -1)return x;
		else return p[x] = find(p[x]);
	}
    void unite(ll x, ll y) {
		x = find(x), y = find(y);
		if (x == y)return;
		p[x] = y;
	}
};

struct edge{
	ll u, v, cost;
};
bool comp(const edge& e1, const edge& e2) {
	return e1.cost < e2.cost;
}


ll V, E;
edge G[200010];

int kruskal() {
	sort(G, G + E, comp);
	UnionFind uf(V);
	ll res = 0;
	rep(i, E) {
		edge e = G[i];
		if (uf.find(e.u) != uf.find(e.v)) {
			uf.unite(e.u, e.v);
			res += e.cost;
		}
	}
	return res;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> V >> E;
	rep(i, E) {
		ll s, t, w; cin >> s >> t >> w; 
		G[i] = { s,t,w };
	}
	cout << kruskal() << endl;
	return 0;
}