Which statement about Weighted Graph is correct?

A. each edge connects two vertices bidirectionally B. there is at most one binomial tree of each degree C. path quality can depend on the sum of weights D. after each full pass, an extreme element reaches its final region