## SWERC14B - Flowery Trails

In order to attract more visitors, the manager of a national park had the idea of planting flowers along both sides of the *popular trails*, which are the trails used by *common people*. *Common people* only go from the park entrance to its highest peak, where views are breathtaking, by a shortest path. So, he wants to know how many metres of flowers are needed to materialize his idea.

For instance, in the park whose map is depicted in the figure, common people make only one of the three following paths (which are the shortest paths from the entrance to the highest peak).

- At the entrance, some start in the rightmost trail to reach the point of interest 3 (after 100 metres), follow directly to point 7 (200 metres) and then pick the direct trail to the highest peak (620 metres).
- The others go to the left at the entrance and reach point 1 (after 580 metres). Then, they take one of the two trails that lead to point 4 (both have 90 metres). At point 4, they follow the direct trail to the highest peak (250 metres).

Notice that popular trails (i.e. the trails followed by common people) are highlighted in yellow. Since the sum of their lengths is 1930 metres, the extent of flowers needed to cover both sides of the popular trails is 3860 metres (3860 = 2 * 1930).

### Task

Given a description of the park, with its points of interest and (two-way) trails, the goal is to find out the extent of flowers needed to cover both sides of the popular trails. It is guaranteed that, for the given inputs, there is some path from the park entrance to the highest peak.

### Input

The first line of the input has two integers: **P** and **T**. **P** is the number of points of interest and **T** is the number of trails. Points are identified by integers, ranging from **0** to **P-1**. The entrance point is **0** and the highest peak is point **P-1**.

Each of the following **T** lines characterises a different trail. It contains three integers, **p _{1}**,

**p**, and

_{2}**l**, which indicate that the (two-way) trail links directly points

**p**and

_{1}**p**(not necessarily distinct) and has length

_{2}**l**(in metres).

Integers in the same line are separated by a single space.

### Constraints

2 ≤ P ≤ 10 000 | Number of points. |

1 ≤ T ≤ 250 000) | Number of trails. |

1 ≤ l ≤ 1 000) | Length of a trail. |

### Output

The output has a single line with the extent of flowers (in metres) needed to cover both sides of the popular trails.

### Sample Input 1

10 15 0 1 580 1 4 90 1 4 90 4 9 250 4 2 510 2 7 600 7 3 200 3 3 380 3 0 150 0 3 100 7 8 500 7 9 620 9 6 510 6 5 145 5 9 160

### Sample Output 1

3860

### Sample Input 2

4 7 0 1 1 0 2 2 0 3 10 0 3 3 1 3 2 2 3 1 1 1 1

### Sample Output 2

18

Author: Margarida Mamede

Added by: | Miguel Oliveira |

Date: | 2014-12-01 |

Time limit: | 1s |

Source limit: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Languages: | All except: ASM64 |

Resource: | SWERC 2014 |