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:
//by azidoazideazide(c2n14)
#include<bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
#define pb push_back
#define fi first
#define se second
#define INF 1e8

vector<pii> adj[100005];
priority_queue<pii, vector<pii>, greater<pii>> q;
bool vis[100005];
int mnw[100005], ans; //min weight of edge to v

int main(){
	int n,m;
	cin>>n>>m;
	for(int i=0,u,v,w;i<m;i++){
		cin>>u>>v>>w;
		adj[u].pb({v,w});
		adj[v].pb({u,w});
	}
	
	for(int i=1;i<=n;i++) mnw[i]=INF;
	mnw[0]=0;
	q.push({0,0});
	while(!q.empty()){
		int fd=q.top().fi, from=q.top().se;
		q.pop();
		if(fd!=mnw[from])  continue;

		vis[from]=1;
		ans+=mnw[from];
		
		for(pii x:adj[from]){
			int to=x.fi, w=x.se;
			if(!vis[to]&&w<mnw[to]){
				mnw[to]=w;
				q.push({mnw[to],to});
			}
		}
	}
	cout<<ans<<endl;
}