Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE?
Your reasoning is absolutely correct for graphs with distinct weights.
But, imagine a graph with a cycle, and all edges weighing 500. The question permits such graphs.