Umm... every path is a minimum cost path in a tree, because there’s exactly one path between any two vertices.
He may have meant a general connected graph (not specifically a tree). In which case, there could be multiple paths and some may be cheaper than others.
It wasn’t a graph though as there was a unique path from the root to each leaf
That’s about as well as I’m going to do here it was a while ago...