Product on Tree

Chef is going to leave his home town and shift to a new city. The new city contains exactly N houses. There are roads connecting the houses in such a way that there is exactly one way to go from a house to any other house. Length of each of the roads is known to Chef. Chief is doing a lot of research before shifting to the new city. He wants to know how many pairs of houses (a,b) are there, such