Why not simpler approaches? Sqrt decomposition: Paths can have nodes.
Even with blocking, queries would be path length, which is too slow. Euler tour + segment tree: Works for subtree queries, but path queries need ancestor information that Euler tours don't preserve well. HLD: Converts any path into contiguous segments.
Each segment maps to a range in a single segment tree. Point updates are also . Time: . Space: .