B"This is the easy version of the problem. The only difference is that in this version k <= min(n,3) . You can make hacks only if both versions of the problem are solved. LuoTianyi now lives in a world with n floating islands. The floating islands are connected by n-1 undirected air routes, and any two of them can reach each other by passing the routes. That means, the n floating islands form a tree. One day, LuoTianyi wants to meet her friends: Chtholly, Nephren, William, .... Totally, she wants to meet k people. She doesn't know the exact positions of them, but she knows that they are in pairwise distinct islands. She define an island is good if and only if the sum of the distances ^{ dagger} from it to the islands with k people is the minimal among all the n islands. Now, LuoTianyi wants to know that, if the k people are randomly set in k distinct of the n islands, then what is the expect number of the good islands? You just need to tell her the expect number modulo 10^9+7 . ^{ dagger} The distance between two islands is the minimum number of air routes you need to take to get from one island to the other. The first line contains two integers n and k ( 1 <= k <= min(n,3), 1 <= n <= 2 cdot 10^5 ) -- the number of the islands and people respectively. Next n xe2 x88 x921 lines describe the air routes. The i -th of them contains two integers u_i and v_i ( 1 <= u_i,v_i <= n, u_i neq v_i ) -- the islands connected by the i -th air route. Print a single integer -- the expect number of the good islands modulo 10^9 + 7 . Formally, let M = 10^9 + 7 . It can be shown that the answer can be expressed as an irreducible fraction frac{p}{q} , where p and q are integers and q not equiv 0 ( operatorname{mod} M ). Output the integer equal to p cdot q^{-1} operatorname{mod} M . In other words, output "...