Trees · Easy problem

A network has a hub $1$ wired directly to each of $2, 3, 4, 5$, plus one extra cable directly between $2$ and $3$. How many different spanning trees (ways to disconnect exactly one redundant cable and keep every vertex reachable) does this network have?