Graph Algorithms · Superchallenge problem

A graph has vertices $j,k,l,m,n,o$ and weighted edges $jk{:}4, jl{:}9, kl{:}2, km{:}7, lm{:}3, ln{:}6, mn{:}5, mo{:}8, no{:}1$. A planner needs a spanning tree that MUST include edge $km$ but must NOT use edge $lm$. What is the minimum possible total weight of such a spanning tree?