{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cp\u003e You are given a tree (an \u003cspan\u003eacyclic\u003c/span\u003e undirected connected graph) with \u003cb\u003eN\u003c/b\u003e nodes, and edges numbered 1, 2, 3...\u003cb\u003eN\u003c/b\u003e-1.\u003c/p\u003e \n \u003cp\u003e We will ask you to \u003cspan\u003eperfrom\u003c/span\u003e some instructions of the following form:\u003c/p\u003e \n \u003cul\u003e \n \u003cli\u003e \u003cb\u003eCHANGE i \u003cspan\u003eti\u003c/span\u003e\u003c/b\u003e : change the cost of the \u003cspan\u003ei-th\u003c/span\u003e edge to \u003cspan\u003eti\u003c/span\u003e\u003cbr\u003e or\u003c/li\u003e \n \u003cli\u003e \u003cb\u003eQUERY a b\u003c/b\u003e : ask for the maximum edge cost on the path from node a to node b\u003c/li\u003e \n \u003c/ul\u003e \n \u003ch3\u003e Input\u003c/h3\u003e \n \u003cp\u003e The first line of input contains an integer \u003cb\u003et\u003c/b\u003e, the number of test cases (\u003cb\u003et\u003c/b\u003e \u0026lt;\u003d 20). t test cases follow.\u003c/p\u003e \n \u003cp\u003e For each test case:\u003c/p\u003e \n \u003cul\u003e \n \u003cli\u003e In the first line there is an integer \u003cb\u003eN\u003c/b\u003e (\u003cb\u003eN\u003c/b\u003e \u0026lt;\u003d 10000),\u003c/li\u003e \n \u003cli\u003e In the next \u003cb\u003eN\u003c/b\u003e-1 lines, the \u003cspan\u003ei-th\u003c/span\u003e line describes the \u003cspan\u003ei-th\u003c/span\u003e edge: a line with three integers \u003cb\u003ea b c\u003c/b\u003e denotes an edge between \u003cb\u003ea\u003c/b\u003e, \u003cb\u003eb\u003c/b\u003e of cost \u003cb\u003ec\u003c/b\u003e (\u003cb\u003ec\u003c/b\u003e \u0026lt;\u003d 1000000),\u003c/li\u003e \n \u003cli\u003e The next lines contain instructions \u003cb\u003e\"CHANGE i \u003cspan\u003eti\u003c/span\u003e\"\u003c/b\u003e or \u003cb\u003e\"QUERY a b\"\u003c/b\u003e,\u003c/li\u003e \n \u003cli\u003e The end of each test case is signified by the string \"\u003cb\u003eDONE\u003c/b\u003e\".\u003c/li\u003e \n \u003c/ul\u003e \n \u003cp\u003e There is one blank line between successive tests.\u003c/p\u003e \n \u003ch3\u003e Output\u003c/h3\u003e \n \u003cp\u003e For each \"\u003cb\u003eQUERY\u003c/b\u003e\" operation, write one integer representing its result.\u003c/p\u003e \n \u003ch3\u003e Example\u003c/h3\u003e \n \u003cpre\u003e\r\n\t\u003cb\u003eInput:\u003c/b\u003e\r\n1\r\n\r\n3\r\n1 2 1\r\n2 3 2\r\nQUERY 1 2\r\nCHANGE 1 3\r\nQUERY 1 2\r\nDONE\r\n\r\n\u003cb\u003eOutput:\u003c/b\u003e\r\n1\r\n3\r\n\u003c/pre\u003e \n\u003c/div\u003e"}}]}