Given a tree of n nodes with values, support two operations: (1) update the value of a node, (2) query the maximum value on the path between two nodes. Both in O(log² n).