There was a question on codeforces similar to the given below statement. Can anyone give me the link or tell me how to solve this?

There are N cities in a country, and all of them are connected by M roads. The country council is planning a roadshow to visit all the N cities, and have asked you to organise it. **** There is a fee E_i to host the show on each i_th road, and the total cost of roadshow is defined as the bitwise OR of all road fees in the itinerary plan. The council has specifically asked that there be no cycles in the final itinerary plan. **** Find the minimum possible cost of roadshow in the country.