Trees · Medium problem

A tree-shaped network has vertices $1$ through $9$ and cables $12, 13, 24, 25, 36, 37, 48, 59$. If cable $12$ fails, how many vertices end up in the SMALLER of the two resulting pieces?