Small-to-large merging computes answers for all nodes in one DFS. This is offline: you get all answers at once, not on demand. If you need to answer queries one at a time in arbitrary order (online), you might need a different approach like persistent data structures or link-cut trees.
For most competitive programming problems, offline is fine. You process the tree once and output all answers together. The offline nature is an advantage for batch processing.