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 JAVA):

Solution:
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
import java.util.*;
public class Main {
	ArrayList<Edge>[] graph;
	int V,E;
	private class Edge implements Comparable<Edge>{
		int to,cost;
		public Edge(int to,int cost){
			this.to =  to;
			this.cost = cost;
		}
		
		public int compareTo(Edge e){
			return this.cost - e.cost;
		}
	}
	
	@SuppressWarnings("unchecked")
    public void solve() {
		V = nextInt();
		E = nextInt();
		graph = new ArrayList[V];
		for(int i = 0;i < V;i++){
			graph[i] = new ArrayList<Edge>();
		}
		for(int i = 0;i < E;i++){
			int s = nextInt();
			int t = nextInt();
			int w = nextInt();
			
			graph[s].add(new Edge(t,w));
			graph[t].add(new Edge(s,w));
		}
		
		int num = 1;
		int sum = 0;
		boolean[] used = new boolean[V];
		used[0] = true;
		PriorityQueue<Edge> pq = new PriorityQueue<Edge>();
		for(Edge e : graph[0]){
			pq.add(e);
		}
		while(pq.size() > 0){
			Edge e = pq.poll();
			if(used[e.to])continue;
			used[e.to] = true;
			num++;
			sum += e.cost;
			if(num == V)break;
			for(Edge next : graph[e.to]){
				if(used[next.to])continue;
				pq.add(next);
			}
		}
		
		out.println(sum);
    }
 
	public static void main(String[] args) {
		out.flush();
		new Main().solve();
		out.close();
	}
		/* Input */
	private static final InputStream in = System.in;
	private static final PrintWriter out = new PrintWriter(System.out);
	private final byte[] buffer = new byte[2048];
	private int p = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (p < buflen)
			return true;
		p = 0;
		try {
			buflen = in.read(buffer);
		} catch (IOException e) {
			e.printStackTrace();
		}
		if (buflen <= 0)
			return false;
		return true;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrint(buffer[p])) {
			p++;
		}
		return hasNextByte();
	}

	private boolean isPrint(int ch) {
		if (ch >= '!' && ch <= '~')
			return true;
		return false;
	}

	private int nextByte() {
		if (!hasNextByte())
			return -1;
		return buffer[p++];
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = -1;
		while (isPrint((b = nextByte()))) {
			sb.appendCodePoint(b);
		}
		return sb.toString();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}