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>
typedef long long lint;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)

struct UnionFind {
    vector<int> v;

    UnionFind(int n) {
        v.resize(n);
        rep(i,n) v[i] = i;
    }
    int root(int x) {
        if (v[x] == x) return x;
        return v[x] = root(v[x]);
    }
    void unite(int x,int y) {
        if (root(x) == root(y)) return;
        v[root(x)] = root(y);
    }
};

int main() {
    int v,e; cin >> v >> e;
    tuple<int,int,int> stw[100000];
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> hq;
    rep(i,e) {
        int s,t,w; cin >> s >> t >> w;
        stw[i] = tuple<int,int,int>(s,t,w);
        hq.push(make_pair(w,i));
    }
    lint ans = 0;
    UnionFind uf(v);
    while (hq.size() != 0) {
        pair<int,int> t = hq.top(); hq.pop();
        int x,y;
        x = get<0>(stw[t.second]);
        y = get<1>(stw[t.second]);
        if (uf.root(x) == uf.root(y)) continue;
        uf.unite(x,y);
        ans += get<2>(stw[t.second]);
    }
    cout << ans << endl;
}