Find a diffrent minimal spanning tree for a graph
You cannot find such a MST. Every two minimal spanning trees must have the same multiset of edge-weights.
Actually you can find the proof in the link that Raphael added:

Do the minimum spanning trees of a weighted graph have the same number of edges with a given weight?