Non CS people may not understand this at first, but you are exactly right. A 'tree' is connected and has n-1 edges. So there can only be precisely one path between any pair of 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.