Hamiltonian path and minimum spanning tree
No.  Every path is a tree, but not every tree is a path.  Therefore,  the minimum spanning path might be more expensive than the minimum spanning tree.

If you work through some examples you should be able to find an explicit counterexample.  I'll let you have the joy of finding it on your own.