If you only need counts or sums, regular subtree DP is simpler and faster. Combine child values with addition or multiplication. If you need to answer queries offline, you might use Euler tour plus segment tree or Mo's algorithm on trees instead.
Small-to-large is best when you need to maintain actual sets or maps, not aggregate values. It is a specialized tool for a specific class of problems where merging containers is unavoidable.