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 ll = long long;
using P = pair<int, int>;

#define INF 1001001001

struct Edge {
  int to;
  int cost;
  Edge(int to, int cost) : to(to), cost(cost) {}
};

int main() {
  int vs, es;
  cin >> vs >> es;
  vector< vector<Edge> > E(vs);
  rep(i,es) {
    int s, t, w;
    cin >> s >> t >> w;
    E[s].emplace_back(t,w);
    E[t].emplace_back(s,w);
  }

  vector<bool> used(vs);
  vector<int> mincost(vs,INF);

  mincost[0] = 0;

  int ans = 0;
  while (true) {
    int v = -1;
    rep(u,vs) if (!used[u] && (v == -1 || mincost[u] < mincost[v])) v = u;

    if (v == -1) break;
    ans += mincost[v];
    used[v] = true;

    for (auto e : E[v]) mincost[e.to] = min(mincost[e.to], e.cost);
  }

  cout << ans << endl;

  return 0;
}