Find minimum spanning tree of undirected weighed graph with root node having exactly k edges

Question

Having an undirected graph with v vertices and e edges with each edges having a non-negative weight of at most w, the task is to find(