Trees · Challenge problem

The triangular prism graph has vertices $1, \ldots, 6$, with triangles $12,23,31$ and $45,56,64$, plus the three "rungs" $14, 25, 36$. Use the Matrix-Tree Theorem to find the number of spanning trees of this graph.