Let \(G\) be any undirected graph with positive edge weights, and \(𝑇\) be a…

Let $G$ be any undirected graph with positive edge weights, and $𝑇$ be a minimum spanning tree of $G$. For any two vertices, $𝑢$ and $𝑣$, let $𝑑_1(𝑢, 𝑣)$ and $𝑑_2(𝑢, 𝑣)$ be the shortest distances between $u$ and $𝑣$ in $G$ and 𝑇, respectively. Which ONE of the options is CORRECT for all possible $𝐺, 𝑇, 𝑢$ and $𝑣$?