Minimal Spanning Tree

Input

The first line contains two integers $n$ and $m$ ( $1 \leq n \leq 20000$ 1 \leq n \leq 20000, $0 \leq m \leq 100000$ 0 \leq m \leq 100000) - the number of vertices and number of edges in a graph. Each of the next $m$ lines describes one edge. The edge number $i$ is given with three integers $b_{i}$ b_i, $e_{i}$ e_i and $w_{i}$ w_i ( $1 \leq b_{i}, e_{i} \leq n$ 1 \leq b_i, e_i \leq n, $0 \leq w_{i} \leq 100000$ 0 \leq w_i \leq 100000) - the numbers of vertices and its weight.

Graph is connected.

Output

Print one number - the weight of the minimal spanning tree.

Examples

Example 1

Loading