We are given a graph and some edges are painted red while others are blue. All edges have weight > 0. Design one efficient algorithm that find a spanning tree with minimum weight s.t it contains at most one red edge.