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 rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;

int par[10010];
int find(int x) {
    if (par[x] == x) return x;
    else return par[x] = find(par[x]);
}
bool same(int x, int y) {
    return find(x) == find(y);
}
void unit(int x, int y) {
    int px = find(x);
    int py = find(y);
    if (px != py) par[py] = px;
}

struct edge {
    int s;
    int t;
    int w;
};
bool operator<(edge e1, edge e2) {return e1.w < e2.w;}
bool operator>(edge e1, edge e2) {return e1.w > e2.w;}

int main() {
    int V, E;
    cin >> V >> E;

    priority_queue<edge, vector<edge>, greater<edge>> que;
    int si, ti, wi;
    rep(i, E) {
        cin >> si >> ti >> wi;
        que.push({si, ti, wi});
    }

    rep(i, V) par[i] = i;

    int ans = 0;
    while (!que.empty()) {
        edge e = que.top();
        que.pop();
        if (!same(e.s, e.t)) {
            ans += e.w;
            unit(e.s, e.t);
        }
    }

    cout << ans << endl;
    
    return 0;
}