Do we have Profit Maximization or City Attractions kind of similar problems in leetcode. Where the edge and node both have values. and we need to return the maximum value of the node with minimum edge weights included? If not I would like to know how can we solve these problems.