Divisible Distances

You are given a tree on $N$ vertices and a positive integer $K$. Determine the maximum possible number of vertices you can choose so that the distance between any two of them is divisible by $K$. The distance between two vertices is defined as the number of edges on the unique simple path between them. ### Input The first line of input contains a single integer $T$ $-$ the number of test cases.