Path Queries II - Lessons

You decomposed a tree into heavy chains, reducing path queries to $O(\log n)$ segment tree queries. The heavy edge rule guarantees the $O(\log n)$ chain crossing property by halving subtree size with each light edge. You combined HLD with a segment tree to handle updates in $O(\log n)$ and queries in $O(\log^2 n)$ per operation.

This technique generalizes to any path operation: sum, min, max, GCD, XOR. Next problem: handling edge-weighted trees with the same structure.