Given an m x n grid of non-negative numbers, find a path from top-left to bottom-right (only moving right or down) that minimizes the sum of numbers along the path. Return the minimum sum.