A spanning tree of a connected graph G is a connected subgraph of G having to cycles.
Spanning Trees:
S1 has weight 3+2+4 = 9
S2 has weight 2+4+1 = 7
S3 has weight 3+2+1 = 6
S4 has weight 3+4+1 = 8
