A tree with $\ge3$ vertices is its own unique spanning tree

Let G be a connected graph with at least 3 vertices such that removal of any edge of G disconnects the graph. Then which of the following is not true?