I am trying to solve this problem : 11354 — Bond

I am using minimum spanning tree but am not able to proceed after finding the minimum cost subgraph. I am not sure if my approach is correct. I would appreciate any help on the method and implementation.

Thanks.