Query a range and watch which disjoint nodes get combined.
Each node stores the sum of a disjoint segment; a range query combines O(log n) of them.
Right bound is even: take node 6. Running total 18.