SPOJ Problem Set (main)
4678. CEOI09 Harbingers
Problem code: CEOI09HA

Once upon a time, there were N medieval towns in the beautiful Moldavian territory, uniquely numbered from 1 through N. The town numbered with 1 was the capital city. The towns were connected by N1 bidirectional roads, each road having a length expressed in kilometers. There was a unique way to travel between any pair of towns without going through a town twice (i.e. the graph of roads was a tree).
When a town was attacked, the situation had to be reported as soon as possible to the capital. The message was carried by harbingers, one of which resided in each town. Each harbinger was characterized by the amount of time required to start the journey and by his constant speed (expressed in minutes per kilometer) after departure.
The message from a town was always carried on the unique shortest path to the capital. Initially, the harbinger from the attacked town carried the message. In each town that he traversed, a harbinger had two options: either go to the next town towards the capital, or leave the message to the harbinger from this town. The new harbinger applied the same algorithm as above. Overall, a message could be carried by any number of harbingers before arriving in the capital.
Your task is to find, for each town, the minimum time required to send a message from that town to the capital.
Input
The first line of the standard input contains one integer N, the number of towns in Moldavia. Each of the following N1 lines contains three integers u v d, separated by one space, describing a road of length d kilometers between towns numbered with u and v. Subsequently, N1 pairs of integers follow, one per line. The ith pair, Si Vi, describes the characteristics of the harbinger in the (i+1)th town: Si is the number of minutes to prepare for the journey, and Vi is the number of minutes needed to travel one kilometer. There is no harbinger in the capital.
Output
To the standard output write exactly one line containing N1 integers. The ith number represents the minimum time, in minutes, required to send a message from the(i+1)th town to the capital.
Example
Input:
5
1 2 20
2 3 12
2 4 1
4 5 3
26 9
1 10
500 2
2 30
Output:
206 321 542 328
Explanation:
The minimum time to send a message from town 5 to the capital is
achieved as follows. The harbinger from town 5 takes the message
and leaves the town after 2 minutes. He walks 4 kilometers in 120
minutes before arriving in town 2. There he leaves the message to
the harbinger from that town. The second harbinger requires 26
minutes to start the journey and walks for 180 minutes before
arriving to the capital.
The total time is therefore 2 + 120 + 26 + 180 = 328.
Constraints
3 ≤ N ≤ 100 000
0 ≤ Si ≤ 1 000 000 000
1 ≤ Vi ≤ 1 000 000 000
The length of each road will not exceed 10 000
Added by:  Ivan Kataniæ 
Date:  20090818 
Time limit:  1s3s 
Source limit:  50000B 
Memory limit:  256MB 
Cluster: 
Pyramid (Intel Pentium III 733 MHz)

Languages:  All except: ASMGCC AWK C++ 4.3.2 C++14 CLOJ COB ERL F# GO GROOVY JS NODEJS PERL 6 PYPY PYTH 3.2.3 PYTH 3.2.3 n PY3.4 SCALA SCM chicken SED TCL VB.net 
Resource:  CEOI 09  Romania 