Let be a simple, undirected, edge-weighted graph with unique edge weights. Which of the following statements about the minimum spanning trees (MST) of is/are true?
- AIn every cycle of , the edge with the largest weight in is not in any MST
- BIn every cycle of , the edge with the smallest weight in is in every MST
- CFor every vertex , the edge with the largest weight incident on is not in any MST
- DFor every vertex , the edge with the smallest weight incident on is in every MST

