#1016. Conquer The World

内存限制:1024 MiB 时间限制:8000 ms 标准输入输出
题目类型:传统 评测方式:文本比较
上传者: qinyihao


题源: ICPC2018 WF

为本题添加标签:树形 DP,左偏树。若算法与标签不符请联系 Mars。

Bwahahahahaha!!! Your nemesis, the dashingly handsome spy Waco Powers, has at last fallen to your secret volcano base's deathtraps (or so you assume, being a little too busy to witness it firsthand). At long last, you are all set to CONQUER THE WORLD!
Nothing will stand in your way! Well, nothing except a minor problem of logistics. Your evil armies have announced that they will not continue carving their relentless path of destruction across the puny nations of the world without being paid. And unfortunately you are running low on cash -− a volcano lair has many wonderful qualities, but reasonably affordable is not one of them. You have had to pull funds from the travel budget to pay your ungrateful underlings. Now you are not sure how you will actually get your armies into position to CONQUER THE WORLD.

All in all, you need to CONQUER THE WORLD.

You have a map of the nations of the world and all your available transport routes between them. Each route connects two nations and has a fixed cost per army that uses it. The routes are laid out such that there is exactly one way to travel between any two nations. You know the current position of each of your armies and how many you will need to place permanently in each nation in order to subjugate it. How can you move the armies into place as cheaply as possible so you can CONQUER THE WORLD?


The first line of input contains an integer n ( 1 \le n \le 250 000 ) , the number of nations. This is followed by n − 1 lines, each containing three integers u , v and c ( 1 \le u , v \le n , 1 \le c \le 10^{6} ), indicating that there is a bidirectional route connecting nations u and v , which costs c per army to use.

Finally, another n lines follow, the i^{th} of which contains two non-negative integers x_i and y_i , indicating that there are currently x_{i} armies in nation i , and you need at least y_{i} armies to end up in that nation in the final configuration. The total number of armies (the sum of the x_{i} values) is at least the sum of the y_{i} values, and no more than 10^{6} .


Display the minimum cost to move your armies such that there are at least y_{i} armies in nation i for all i .


input 1

1 2 5
3 1 5
2 1
5 0
1 3

output 1


input 2

1 2 2
1 3 5
1 4 1
2 5 5
2 6 1
0 0
1 0
2 1
2 1
0 1
0 1

output 2



Time limit: 8 s, Memory limit: 1024 MB.