A graph $G$ is constructed by taking two disjoint cycle graphs $C_5$ and $C_7$ and connecting them by adding a single edge between a vertex in $C_5$ and a vertex in $C_7$. What is the total number of edges in this graph?