Some country consists of n cities, connected by a railroad network. The transport communication of the country is so advanced that the network consists of a minimum required number of ( n - 1) bidirectional roads (in the other words, the graph of roads is a tree). The i -th road that directly connects cities a i and b i , has the length of l i kilometers. The transport network is served by a state transporting company FRR (Fabulous Rail Roads). In order to simplify the price policy, it offers a single ride fare on the train. In order to follow the route of length t kilometers, you need to pay burles. Note that it is forbidden to split a long route into short segments and pay them separately (a special railroad police, or RRP, controls that the law doesn't get violated). A Large Software Company decided to organize a programming tournament. Having conducted several online rounds, the company employees determined a list of finalists and sent it to the logistical department to find a place where to conduct finals. The Large Software Company can easily organize the tournament finals in any of the n cities of the country, so the the main factor in choosing the city for the last stage of the tournament is the total cost of buying tickets for all the finalists. We know that the i -th city of the country has w i cup finalists living there. Help the company employees find the city such that the total cost of travel of all the participants to it is minimum. The first line of the input contains number n ( 1 ≤ n ≤ 200 000 ) — the number of cities in the country. The next line contains n integers w 1 , w 2 , ..., w n ( 0 ≤ w i ≤ 10 8 ) — the number of finalists living in each city of the country. Next ( n - 1) lines contain the descriptions of the railroad, the i -th line contains three integers, a i , b i , l i ( 1 ≤ a i , b i ≤ n , a i ≠ b i , 1 ≤ l i ≤ 1000 ). Print two numbers — an integer f that is the number of the optimal city to conduct the competition, and the