Helga Hufflepuff's Cup

题意翻译

### 题目描述 给你一棵树，可以染 $m$ 种颜色，定义一个特殊颜色 $k$，要求保证整棵树上特殊颜色的个数不超过 $x$ 个。同时，如果一个结点是特殊颜色，那么它的相邻结点的颜色编号必须全部小于 $k$。求方案数。 ### 输入格式 第 $1$ 行，输入两个正整数 $n,m$。 第 $2 \thicksim n$ 行，每行输入两个数 $u_{i},v_{i}$，表示在 $u_{i}$ 到 $v_{i}$ 间存在一条边。 第 $n+1$ 行，输入两个正整数 $k,x$。 ### 说明/提示 $1 \leq n \leq 10^5$，$1 \leq m \leq 10^9$； $1 \leq k \leq m$，$1 \leq x \leq 10$。

题目描述

Harry, Ron and Hermione have figured out that Helga Hufflepuff's cup is a horcrux. Through her encounter with Bellatrix Lestrange, Hermione came to know that the cup is present in Bellatrix's family vault in Gringott's Wizarding Bank. The Wizarding bank is in the form of a tree with total $ n $ vaults where each vault has some type, denoted by a number between $ 1 $ to $ m $ . A tree is an undirected connected graph with no cycles. The vaults with the highest security are of type $ k $ , and all vaults of type $ k $ have the highest security. There can be at most $ x $ vaults of highest security. Also, if a vault is of the highest security, its adjacent vaults are guaranteed to not be of the highest security and their type is guaranteed to be less than $ k $ . Harry wants to consider every possibility so that he can easily find the best path to reach Bellatrix's vault. So, you have to tell him, given the tree structure of Gringotts, the number of possible ways of giving each vault a type such that the above conditions hold.

输入输出格式

输入格式

The first line of input contains two space separated integers, $ n $ and $ m $ — the number of vaults and the number of different vault types possible. ( $ 1<=n<=10^{5},1<=m<=10^{9} $ ). Each of the next $ n-1 $ lines contain two space separated integers $ u_{i} $ and $ v_{i} $ ( $ 1<=u_{i},v_{i}<=n $ ) representing the $ i $ -th edge, which shows there is a path between the two vaults $ u_{i} $ and $ v_{i} $ . It is guaranteed that the given graph is a tree. The last line of input contains two integers $ k $ and $ x $ ( $ 1<=k<=m,1<=x<=10 $ ), the type of the highest security vault and the maximum possible number of vaults of highest security.

输出格式

Output a single integer, the number of ways of giving each vault a type following the conditions modulo $ 10^{9}+7 $ .

输入输出样例

输入样例 #1

4 2
1 2
2 3
1 4
1 2

输出样例 #1

1

输入样例 #2

3 3
1 2
1 3
2 1

输出样例 #2

13

输入样例 #3

3 1
1 2
1 3
1 1

输出样例 #3

0

说明

In test case $ 1 $ , we cannot have any vault of the highest security as its type is $ 1 $ implying that its adjacent vaults would have to have a vault type less than $ 1 $ , which is not allowed. Thus, there is only one possible combination, in which all the vaults have type $ 2 $ .

题意翻译

### 题目描述 给你一棵树，可以染 $m$ 种颜色，定义一个特殊颜色 $k$，要求保证整棵树上特殊颜色的个数不超过 $x$ 个。同时，如果一个结点是特殊颜色，那么它的相邻结点的颜色编号必须全部小于 $k$。求方案数。 ### 输入格式 第 $1$ 行，输入两个正整数 $n,m$。 第 $2 \thicksim n$ 行，每行输入两个数 $u_{i},v_{i}$，表示在 $u_{i}$ 到 $v_{i}$ 间存在一条边。 第 $n+1$ 行，输入两个正整数 $k,x$。 ### 说明/提示 $1 \leq n \leq 10^5$，$1 \leq m \leq 10^9$； $1 \leq k \leq m$，$1 \leq x \leq 10$。