We are given a connected graph G with costs c (i,j) on edges. Assume all costs are positive integers and that there are no ties. If all edge costs are multiplied by 10( meaning each edge cost c'(i,j)=c(i,j)•10), the Minimum Spanning Tree (MST) remains the same tree.