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;
typedef pair<int,int> pii;
int main()
{
    priority_queue < pii , vector<pii> , greater <pii> > a;
    int V, E;
    cin >> V >> E;
    vector <pii> vec[V];
    int mar[V],dis[V];
    for(int i=0;i<E;i++)
    {
        int u,v,d;
        cin >> u >> v >> d;
        vec[u].push_back(make_pair(v,d));
        vec[v].push_back(make_pair(u,d));
    }
    for(int i=0;i<V;i++)
    {
        mar[i]=0;
        dis[i]=INT_MAX;
    }
    dis[0]=0;
    a.push(make_pair(0,0));
    int sum=0;
    for(;!a.empty();)
    {
        pii t=a.top();
        a.pop();
        if(mar[t.second]==0)
        {
            for(int i=0;i<vec[t.second].size();i++)
            {
                if(dis[vec[t.second][i].first]>vec[t.second][i].second)
                {
                    dis[vec[t.second][i].first]=vec[t.second][i].second;
                    a.push(make_pair(dis[vec[t.second][i].first],vec[t.second][i].first));
                }
            }
            mar[t.second]=1;
            sum+=dis[t.second];
        }
    }
    cout << sum << endl;
}