Which of the following statements are true?

I. If (u,v) is a maximum-weight edge on a cycle in a connected graph G then edge (u, v) must belong to the minimum spanning tree of G.

II. if an edge (u,v) is contained in some minimum spanning tree, then it is a light edge crossing some cut of the graph.

III. If (u,v) is a light edge connecting CC(connected component) to some other component in the forest of graph G, then (u, v) is included in the minimum spanning tree.