Given a weighted graph, the shortest path from a source to a destination is calculated using the shortest path algorithm. If the weight of every edge is increased by one, the shortest path will necessarily remain the same.

Your answer seems reasonable.
Find out if you're right!