Solution
= Solution
\b[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.