When we traverse a graph, and we get a tree.
By depth first traversal, we get DFT. So the edges of graph that are present in DFT are called tree edges. There are back edges, cross edges, which are not present in the tree.
So, he is saying in first statement that, no matter how we traverse the graph, we will get the same number of tree edges.
Which is correct.