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<n;i++)
typedef long long ll;
struct edge{int to,cost;};
typedef pair<int,int> P;
int V;
vector<edge> G[200001];
int mincost[200001],INF=1e9,used[200001]={0};
int prim(){
    priority_queue<P,vector<P>,greater<P> > que;
    fill(mincost,mincost+V,INF);
    mincost[0]=0;
    int res=0;
    que.push(P(0,0));
    while(!que.empty()){
        P p=que.top();que.pop();
        int v=p.second;
        if(used[v]) continue;
        res+=mincost[v];
        used[v]++;
        rep(i,G[v].size()){
            edge e=G[v][i];
            if(mincost[e.to]>e.cost) mincost[e.to]=e.cost,que.push(P(mincost[e.to],e.to));
        }
    }
    return res;
}
int main(){
    int E,a,b,c;
    cin>>V>>E;
    rep(i,E) cin>>a>>b>>c,G[a].push_back({b,c}),G[b].push_back({a,c});
    cout<<prim()<<endl;
}