Using Dijikstras algorithm, we will find minimum weight edges which may or may not be adjacent but not forming cycle so that all vertices are visited.
Selecting minimum weight edge is GH(2)---------1
then next minimum weight edge is GJ(3)--------- 2
then next minimum weight edge is JK(4)--------- 3
then next minimum weight edge is IJ(4)--------- 4
Total edges are 8, 4 are visited therefore remaining are 8-4=4 which are GK(5), KI(5), KH(6), HI(7)