If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.

• A. True
• B. False