QTREE  Query on a tree
You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N1.
We will ask you to perfrom some instructions of the following form:
 CHANGE i ti : change the cost of the ith edge to ti
or  QUERY a b : ask for the maximum edge cost on the path from node a to node b
Input
The first line of input contains an integer t, the number of test cases (t <= 20). t test cases follow.
For each test case:
 In the first line there is an integer N (N <= 10000),
 In the next N1 lines, the ith line describes the ith edge: a line with three integers a b c denotes an edge between a, b of cost c (c <= 1000000),
 The next lines contain instructions "CHANGE i ti" or "QUERY a b",
 The end of each test case is signified by the string "DONE".
There is one blank line between successive tests.
Output
For each "QUERY" operation, write one integer representing its result.
Example
Input: 1 3 1 2 1 2 3 2 QUERY 1 2 CHANGE 1 3 QUERY 1 2 DONE Output: 1 3
hide comments
Sliti khaled:
20160513 03:04:20
Very good problem ! 

haogram:
20160422 15:43:37
treechain seperate 

Vipul:
20160415 16:46:37
Anudeep Rocks.... 

linkret:
20160322 16:17:44
HLD is Heavy  Light Decomposition. Alot of code. 

austine:
20160303 10:34:01
Classical problem 

Obliterator:
20151105 06:45:11
Huge number of accepted solutions is because of Anudeep's blog explaining HLD very clearly http://blog.anudeep2011.com/heavylightdecomposition/ Last edit: 20151106 12:07:05 

kingston:
20151008 18:38:59
longest code ever written by me 

(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20150727 23:36:30
woah, this hard problem is solved by 1775++ users (o_O)


yyy_ugly:
20150415 08:50:44
yyy handsome ahead.............. 

lcr88888:
20150414 13:55:35
YYY is handsome. Last edit: 20150414 14:08:43 
Added by:  ThanhVy Hua 
Date:  20050608 
Time limit:  0.851s 
Source limit:  15000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  ADA95 ASM32 BASH BF C CSHARP CPP CLPS LISP sbcl LISP clisp D FORTRAN HASK ICON ICK JAVA LUA NEM NICE OCAML PASGPC PASFPC PERL PHP PIKE PRLGswi PYTHON RUBY SCM qobi SCM guile ST TEXT WHITESPACE 