Given an m x n matrix filled with non-negative integers, find the minimum sum along a path from the top-left of the grid to the bottom-right which minimizes the sum of all numbers along it. Return this minimum sum. The direction of movement is limited to right and down.