Graph Algorithms · Hard problem

A network connects sites $a,b,c,d,f,g$ with possible cables and costs $ab{:}2, bc{:}2, cd{:}2, af{:}5, bf{:}5, dg{:}6, cg{:}6$. How many different minimum spanning trees does this network have?