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<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
using namespace std;
#define MK make_pair
#define F first
#define S second
#define ege pair<int,pair<int,int>> //w,s,t
const int MX=1e9+7;

int a[11000];

int search(int c){
    if(a[c]==c){return c;}
    a[c]=search(a[c]);
    return a[c];
}




int main(){
    int v,e;
    int W=0;
    for(int i=0;i<11000;i++){
        a[i]=i;
    }
    priority_queue<ege> E;
    cin>>v>>e;
    for(int i=0;i<e;i++){
        int s,t,w;
        cin>>s>>t>>w;
        E.push({-1*w,{s,t}});
    }
    while(!E.empty()){
        ege t=E.top();
        E.pop();
        int sp=search(t.S.F);
        int tp=search(t.S.S);
        if(sp==tp){continue;}
        a[sp]=tp;
        W-=t.F;
    }
    cout<<W<<endl;
    
    return 0;
}