Edges inducing an acyclic graph

Question

Let $G$ on $n$ vertices and $j_1,\dots,j_k$ be some edges inducing an acyclic graph. I want to show that $k$ is $n-q$, where $q$ is the number of the connected components of the acyclic graph.

I have no clue.