Groot and Trees

Groot loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n , and each node has an integer〖 c〗_i , attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i,j) such that the following four conditions are all satisfied: i ≠j i ∈the path from node