Fertilizing Pastures

문제

There are $NN$ pastures ($2\le N\le 2\cdot {10}^{5}2\; \backslash le\; N\; \backslash le\; 2\backslash cdot\; 10^5$), connected by $N-1N-1$ roads, such that they form a tree. Every road takes 1 second to cross. Each pasture starts out with 0 grass, and the $ii$th pasture's grass grows at a rate of $a_{i}a\_i$ ($1\le a_i\le {10}^{8}1\backslash le\; a\_i\backslash le\; 10^8$) units per second. Farmer John is in pasture 1 at the start, and needs to drive around and fertilize the grass in every pasture. If he visits a pasture with $xx$ units of grass, it will need $xx$ amount of fertilizer. A pasture only needs to be fertilized the first time it is visited, and fertilizing a pasture takes 0 time.

The input contains an additional parameter $T\in \{0,1\}T\backslash in\; \backslash \{0,1\backslash \}$.

• If $T=0T=0$, Farmer John must end at pasture 1.
• If $T=1T=1$, Farmer John may end at any pasture.

Compute the minimum amount of time it will take to fertilize every pasture and the minimum amount of fertilizer needed to finish in that amount of time.

입력

The first line contains $NN$ and $TT$.

Then for each $ii$ from $22$ to $NN$, there is a line containing $p_{i}p\_i$ and $a_{i}a\_i$, meaning that there is a road connecting pastures $p_{i}p\_i$ and $ii$. It is guaranteed that .

출력

The minimum amount of time and the minimum amount of fertilizer, separated by spaces.

5 0
1 1
1 2
3 1
3 4

8 21

5 1
1 1
1 2
3 1
3 4

6 29