##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Sum on changing paths
Given a forest, handle:
link u v: Add edge (forest property maintained)cut u v: Remove edgeadd u v x: Add x to all nodes on path u to vquery u v: Sum of values on path u to vThis extends connectivity with path aggregates. Link-Cut trees handle this naturally with lazy propagation for updates and subtree sums for queries.