[HackerEarth] The statement of this problem is short and simple. There is a tree with vertices labelled from 1 to N. You are supposed to count the total number of such pairs in a tree that satisfy the - 题解