Trees · Hard problem

Graph $G$ has parts $\{1,2\}$ and $\{3,4,5\}$ with all $6$ cross edges of $K_{2,3}$, PLUS one extra edge $34$ within the size-$3$ part. Use the Matrix-Tree Theorem to find the number of spanning trees of $G$.