Let T = (V , E) be a tree with |V | = n ≥ 2. How many distinct paths are there (as sub graphs) in T?

I already have the answer to this question as (n/2). The problem that I'm having is finding anything in the text that helps me to figure out how to arrive at this answer.