Let be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in has even weight. Which of the following statements is/are TRUE for every such graph ?
- AAll edges in have even weight.
- BAll edges in have even weight OR all edges in have odd weight.
- CIn each cycle in , all edges in have even weight.
- DIn each cycle in , either all edges in have even weight OR all edges in have odd weight

