Minimum Spanning Tree

For all spanning trees, there must be one where the sum of all weights is minimal, this is called a minimum spanning tree (MST). In this example, $\sum \text{weights}=37$.