Yes, I agree with the claim made and for its proof,
Taking an instance where we have more than one similar edge weights could be the graph (not neccessarily) on which applying kruskal's algo could give us more than one M.S.T's .
NOTE:- The claim holds false everytime we have distinct edge weights.
Let me know if I was wrong.