DSU on tree answers subtree queries by keeping the largest child's contribution and rebuilding only the small parts. The trick is not union-find; it is small-to-large merging hidden inside a DFS.

compare shortest path algorithms: dijkstra, floyd, bellman-ford

this is a description