Let $G$ be a graph obtained by adding a single edge (chord) between two non-adjacent vertices of the cycle graph $C_5$. How many unique spanning trees does $G$ have?