B'There is a tree of N vertices and N-1 edges. The i -th edge connects vertices U_i and V_i and has a length of W_i . Chaneka, the owner of the tree, asks you Q times. For the j -th question, the following is the question format: Notes: The first line contains a single integer N ( 2 <= q N <= q10^5 ) -- the number of vertices in the tree. The i -th of the next N-1 lines contains three integers U_i , V_i , and W_i ( 1 <= q U_i,V_i <= q N ; 1 <= q W_i <= q10^9 ) -- an edge that connects vertices U_i and V_i with a length of W_i . The edges form a tree. The (N+1) -th line contains a single integer Q ( 1 <= q Q <= q10^5 ) -- the number of questions. The j -th of the next Q lines contains two integers X_j and K_j as described ( 1 <= q X_j <= q N ; 1 <= q K_j <= q 10^9 ). Output Q lines with an integer in each line. The integer in the j -th line represents the diameter of the tree on the j -th question. In the first example, the following is the tree without any changes. The following is the tree on the 1 -st question. The maximum distance is between vertices 6 and 7 , which is 6+6+6=18 , so the diameter is 18 . The following is the tree on the 2 -nd question. The maximum distance is between vertices 2 and 6 , which is 3+2+6=11 , so the diameter is 11 . '...