A12328 | Vladislav and a Great Legend

A great legend used to be here, but some troll hacked Codeforces and erased it. Too bad for us, but in the troll society he earned a title of an ultimate-greatest-over troll. At least for them, it's something good. And maybe a formal statement will be even better for us?

You are given a tree $T$ with $n$ vertices numbered from $1$ to $n$ . For every non-empty subset $X$ of vertices of $T$ , let $f(X)$ be the minimum number of edges in the smallest connected subtree of $T$ which contains every vertex from $X$ .

You're also given an integer $k$ . You need to compute the sum of $(f(X))^k$ among all non-empty subsets of vertices, that is:

$$\sum\limits_{X \subseteq \{1, 2,\: \dots \:, n\},\, X \neq \varnothing} (f(X))^k.$$

The first line contains two integers $n$ and $k$ ( $2 \leq n \leq 10^5$ , $1 \leq k \leq 200$ ) — the size of the tree and the exponent in the sum above.

Each of the following $n - 1$ lines contains two integers $a_i$ and $b_i$ ( $1 \leq a_i,b_i \leq n$ ) — the indices of the vertices connected by the corresponding edge.

It is guaranteed, that the edges form a tree.

Print a single integer — the requested sum modulo $10^9 + 7$ .