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 <iostream>
#include <vector>
#include <utility>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vint;
#define mp make_pair
#define fst first
#define scn second
const int inf=1e9;
int color[10010];
int findparent(int i){
    return (i==color[i]?i:color[i]=findparent(color[i]));
}
void merge(int i,int j){
    i=findparent(color[i]);
    j=findparent(color[j]);
    color[j]=i;
}
int main(){
    int v,e;    cin>>v>>e;
    priority_queue<pair<int,pii > > pq;
    for(int i=0;i<e;i++){
        int s,t,w;  cin>>s>>t>>w;
        pq.push(mp(-w,mp(s,t)));
    }
    for(int i=0;i<v;i++)    color[i]=i;
    int ret=0;
    while(!pq.empty()){
        auto it=pq.top();   pq.pop();
        int w=-it.fst;
        int s=it.scn.fst,t=it.scn.scn;
        if(findparent(s)==findparent(t))    continue;
        ret+=w;
        merge(s,t);
    }
    cout<<ret<<endl;
    return 0;
}