Graph Algorithms · Easy problem

An irrigation system must connect fields $A,B,C,D,E$ with trenches, with costs $AB{:}7, AC{:}9, BC{:}5, BD{:}8, CD{:}3, CE{:}6, DE{:}2$. What is the minimum total trench length needed to connect all five fields?