Shortest path between any pair of vertices may change.
Consider the following graph A,B,C,D
Current shortest path between A and D is from A to D, which is 11 but if we reduce every edge weight by 2, the shortest path between A and D will be A->B->C->D which will be (1+2+3) = 6.