Suppose a simple graph $G$ on $5$ vertices has an adjacency matrix $A$ such that the diagonal of $A^2$ is $(3, 2, 2, 2, 1)$. What is the total number of edges in $G$?