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 ll long long
pair< ll,pair<ll,ll> >edge[100010];
ll parent[10010];
ll root(ll x)
{
    if(parent[x]==x)
    {
        return x;
    }
    else
    {
        parent[x]=root(parent[x]);
        return parent[x];
    }
}
void un(ll a,ll b)
{
    a=root(a);
    b=root(b);
    parent[a]=parent[b];
}
ll kruskal(pair<ll,pair<ll,ll>>p[] , ll m )
{
    ll i,j,a,b,cost=0,c;
    for(i=0;i<m;i++)
    {
       a= p[i].second.first;
       b= p[i].second.second;
       c= p[i].first;
       if(root(a)!=root(b))
       {
           un(a,b);
           cost+=c;
       }
    }
    return cost;
}
void init()
{
    for(ll i=0;i<=10000;i++)
    {
        parent[i]=i;
    }
}
int main()
{
    ll n,m,i,j,a,b,c,ans=0; init();
    cin>>n>>m;
    for(i=0;i<m;i++)
    {
        cin>>a>>b>>c;
        edge[i]=make_pair(c,make_pair(a,b));
        edge[i]=make_pair(c,make_pair(b,a));
    }
    sort(edge,edge+m);
    ans=kruskal(edge,m);
    cout<<ans<<endl;
}