The minimum spanning tree of a connected weighted graph with ver

The minimum spanning tree of a connected weighted graph with vertex set V={ A, B, C, D, E } and weight set W={ 1, 3, 2, 5, 2, 7, 9, 8, 4 } must be unique. ~@[](2)

答案：FALSE