问题：
[单选题]
Suppose we are given an instance of the minmum spanning tree problem on a graph G, with edge costs that are all positive and distinct. Let T be a minimum spanning tree for this instance.
Now suppose we replace each edge cost ce by its square ce2, thereby creating a new instance of the problem with the same graph but different costs.
Decide whether you think the following statement is true or false.
T must still be a minimum spanning tree for this new instance.
A正确
B错误
