The meaning of problems
Given a tree, at some point a bit weight W $ $, fall time $ t $
In time $ t $ $ V you can remove at $ subtree rooted at the node, thereby obtaining the subtree $ t [x] = t [v] the right point node $ $ w [x] $
The right to ask to get maximum points and
$subtask3$
When $ t [son] <= t [ansetor] $ $ when $ Son contribution to be calculated, i.e., increase the longest seek sequence $ o (nlogn) $