A depth-first search of an undirected graph produces the same number of tree edges

Question

I\'m trying to show that a depth-first search of an undirected graph always produces the same number of tree edges. I know that this statement does not hold