Apply prims algorithm here.Consider newly added vertex as starting vertex.So how will you proceed farther?You must take the least weighted edge adjacent to that vertex.After doing this you are done.Because the other component was MST already and now also overall spanning tree is minimum.