Let $G=(V,E)$ be a weighted graph and let $M$ be the minimum spanning

tree of $G.$ Prove or disprove the following statement:

The path in $M$ between any pair of vertices $x$ and $y$ must be a shortest path

between $x$ and $y$ in $G.$