Hi, I have a question related to MST.

Suppose that we are given a graph where we have limited knowledge of the edge weights: Example

Is it possible to find all edges that are contained in at least one MST?

Thank you...