The roads in ByteLandia
The ByteLandia is a country situated on islands. There was the presidential election. Bityk won the election. He decided to visit the islands on his new RoverLand. For that he need to build the bridges between some of the islands. Due to the fact that the budget in the country is limited, the bridges must be build in one way. After Bityk visited some of the islands, he return to capital by helicopter with his car (the budget for the flying is not limited, but he need to ride on roads which was just built – this is a duty of the president). That mean that the route if presitent must consist from 2 parts:
On his RoverLand he is getting in some islands
From island to the capital he is returning on helicopter
For each kilometer of bridge needs to pay 1 ByteLandia tugrik. The architect gave president the list of bridges, which theoretically could be build, without harming the nature of islands.
Help Bityk to calculate which minimum budget he need to allocate. The bridge need to be build is such way that it would be possible to get from the capital to any other island.
Input
In the first line will be input two positive numbers N (1 ≤ N ≤ 10^4) – number of islands, and M (1 ≤ M ≤ 10^5) – number of projects for bridges. In next M lines will be 3 positive integers: u (1 ≤ u ≤ N), v (1 ≤ v ≤ N), w (1 ≤ w ≤ 10^5), where u, v – numbers of islands, which will be connected by certain bridge, and w – length of bridge. Between two islands can be several numbers of bridges with different length. In the last line only one positive integer X (1 ≤ X ≤ N) – number of capital.
Output
If it will be exist island, which will be not reachable by Bityk, simply output "Helicopter" (without quotes), else output the budget of all new constructions.