Finding minimum spanning tree with O(|V|)
Use DFS to find a cycle in the graph (in linear time). Save the maximum-weight edge while performing DFS, Delete it from the outputted cycle. 
Repeat 11 times.
Done.