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>
#define ii pair<int,int>
#define iii pair<int,ii>

using namespace std;

int n,e,parent[10004];
vector<iii>graph;

void init(int n,int e){
    for(int i=0; i<e; i++){
        int u,v,w;
        cin>>u>>v>>w;
        graph.push_back(iii(w,ii(u,v)));
    }
}

int findParent(int r){
    if(parent[r]==r)return r;
    return parent[r]=findParent(parent[r]);
}

int krus(){
    int cntEdge=0,cost=0;
    for(int i=0; i<n; i++)parent[i]=i;
    sort(graph.begin(),graph.end());

    for(int i=0; i<graph.size(); i++){
        int u=findParent(graph[i].second.first),
            v=findParent(graph[i].second.second),
            w=graph[i].first;
        if(u!=v){
            parent[u]=v;
            cost+=w;
            cntEdge++;
        }if(cntEdge==n-1)break;
    }

    return cost;
}

int main(){
    cin>>n>>e;
    init(n,e);
    cout<<krus()<<endl;
return 0;
}