Graph Algorithms

Let $G$ be any connected, weighted, undirected graph. I. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. II. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimum-weight edge crossing the cut. Which of the above two statements is/are TRUE?