A connected graph $G$ with $n$ vertices is defined as a 'tree'. If we add one edge between two non-adjacent vertices, what is the resulting number of cycles in the graph?