Trees · Superchallenge problem

Graph $G$ is built by taking $K_4$ on vertices $1,2,3,4$ and $K_5$ on vertices $4,5,6,7,8$, identifying them at the single shared vertex $4$. How many spanning trees does $G$ have?