Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Functional programming, design and analysis of algorithms (resit) / 8 / b / iii

False. Take a triangle with $w(ab)=w(bc)=2$ and $w(ac)=3$. Its unique minimum spanning tree uses $ab$ and $bc$, with total weight 4. The shortest path from $a$ to $c$ in the original graph is the direct edge of weight 3; the tree's only path has weight 4. A minimum spanning tree optimizes total tree weight, not every pairwise path length.