Alternating Tree

You are given an undirected graph with N nodes and M edges. Each edge has a cost associated with it and is colored either black or white. You need to find a spanning tree with minimum cost such that for every path in the tree, the color of edges is alternating. The cost of the spanning tree is the sum of cost of edges in it. Print the minimum cost. Input The first line of input contains 2 integ