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,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define ll __int64
#define __int64 long long
#define P pair<int,int>
#define PP pair<P,int>

int v,e;
vector<P>G[111111];
bool visit[111111];
int t[111111];
int main() {
    cin>>v>>e;
    rep(i,e){
        int a,b,c;
        cin>>a>>b>>c;
        G[a].pb(mp(b,c));
        G[b].pb(mp(a,c));
    }
    priority_queue<P,vector<P>,greater<P> >q;

    q.push(mp(0,0));

    while(!q.empty()){
        int cost=q.top().first,from=q.top().second;
        q.pop();
        if(visit[from])
            continue;
        visit[from]=1;
        t[from]=cost;
        //cout<<from<<" "<<cost<<endl;
        for(int i=0;i<G[from].size();i++){
            int to=G[from][i].first,next_cost=G[from][i].second;
            q.push(mp(next_cost,to));
        }
    }
    int ans=0;
    rep(i,v)ans+=t[i];
    cout<<ans<<endl;

    return 0;
}