Consider a weighted undirected graph with positive edge weights and let (u, v) be an [2]
edge in the graph. It is known that the shortest path from source vertex r to u has
weight 53 and shortest path from r to v has weight 65. Which statement is always true?