问题：
[判断题]
Suppose we are given an instance of the s−t shortest path problem on a directed graph G. We assume that all edge cost are positive and distinct. Let P be a minimum-cost s−t path 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.
P must still be a minimum-cost s−t path for this new instance.
P must still be a minimum-cost s−t path for this new instance.
