Chef and Pairs

You are given a tree (connected, undirected, acyclic graph) consisting of $N$ nodes. Based on this tree, you have to answer $Q$ queries. Each query is of the form: - $K\ D\ V_1\ V_2\ \cdots\ V_K$ - output the number of pairs $(i, j)$, $1 \leq i \lt j \leq K$, such that the shortest path between nodes $V_i$ and $V_j$ in the tree has $D$ edges. ### Input - The first line contains an integer $T