Suppose that we have an MST T of a graph G but are told that an edge not in T has a lower weight than originally specified and so T is now an invalid MST. Is it guaranteed that we can fix our tree by removing an edge and adding a different one? If so, explain how. If not, provide a counterexample.