Trees · Easy problem

Using the Matrix-Tree Theorem, how many spanning trees does the triangle $K_3$ (vertices $1,2,3$, all three edges $12,23,13$ present) have?