Subset sum problem memoized- Overlapping sub problems

In memoization for input case A = [1,2] and Sum = 4, following recursive call will be made

Since there are no overlapping sub-problem in this case, memoization will make same number of call as recursion(without memoization). So why the time complexity is O(N*Sum) instead of exponential in worst case?