Problem: 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.

Input

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 ≤ 105, 1 ≤ m ≤ 109).

Each of the next n - 1 lines contain two space separated integers ui and vi (1 ≤ ui, vi ≤ n) representing the i-th edge, which shows there is a path between the two vaults ui and vi. 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

Output a single integer, the number of ways of giving each vault a type following the conditions modulo 109 + 7.

Examples

Input

4 2
1 2
2 3
1 4
1 2


Output

1


Input

3 3
1 2
1 3
2 1


Output

13


Input

3 1
1 2
1 3
1 1


Output

0

Note

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.

Solution (in JAVA):

Solution:
import java.io.*;

import java.util.*;

public class CF_855_C_HELGA_HUFFLEPUFF_CUP {
	static int[] firstChild, firstSibling, adjList[], memo[][];
	static int k, m;
	static final int MOD = (int) 1e9 + 7;

	// 0 -> (< k) , 1 -> (== k) , 2 -> (> k)
	static int mult(int x, int y) {
		return (int)((1l*x * y) % MOD);

	}

	static int lessK(int nxtChild, int nxtSibling, int nxtRemChild, int nxtRemSibling, int lastPos) {
		return mult(k - 1, mult (dp(nxtChild, 0, nxtRemChild) , dp(nxtSibling, lastPos, nxtRemSibling)));
		
	}

	static int equalK(int nxtChild, int nxtSibling, int nxtRemChild, int nxtRemSibling, int lastPos) {
		return mult(dp(nxtChild, 1, nxtRemChild) , dp(nxtSibling, lastPos, nxtRemSibling));

	}

	static int greaterK(int nxtChild, int nxtSibling, int nxtRemChild, int nxtRemSibling, int lastPos) {
		return mult(m - k, mult(dp(nxtChild, 2, nxtRemChild) , dp(nxtSibling, lastPos, nxtRemSibling)));

	}

	static int dp(int u, int last, int remX) {
		if (u == -1)
			return remX == 0 ? 1 : 0;

		if (memo[u][last][remX] != -1)
			return memo[u][last][remX];
		int ans = 0;

		for (int i = 0; i <= remX; i++) {
			if (last == 0) {
				ans += lessK(firstChild[u], firstSibling[u], i, remX - i, last);
				ans = fixMod(ans);
				
				if (i > 0 ) {
					ans += equalK(firstChild[u], firstSibling[u], i - 1, remX - i, last);
					ans = fixMod(ans);
					
				}
				ans += greaterK(firstChild[u], firstSibling[u], i, remX - i, last);
				ans = fixMod(ans);
				

			} else if (last == 1) {
				ans += lessK(firstChild[u], firstSibling[u], i, remX - i, last);
				ans = fixMod(ans);
				

			} else if (last == 2) {
				ans += lessK(firstChild[u], firstSibling[u], i, remX - i, last);
				ans = fixMod(ans);
				
				ans += greaterK(firstChild[u], firstSibling[u], i, remX - i, last);
				ans = fixMod(ans);
				
			}

		}

		return memo[u][last][remX] = ans;
	}

	static int fixMod(int x)
	{
		if(x > MOD)
			return x-=MOD ;
		return x ; 
		
	}
	static void dfs(int u, int p) {
		int last = -1;

		for (int i = 0, n = adjList[u].length; i < n; i++) {
			int v = adjList[u][i];

			if (v != p) {
				if (last == -1)
					last = firstChild[u] = v;
				else {
					firstSibling[last] = v;
					last = v;
				}
				dfs(v, u);
			}

		}

	}

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner();

		int n = sc.nextInt();
		m = sc.nextInt();

		int cnt = n - 1;
		int[] xx = new int[n - 1];
		int[] yy = new int[n - 1];
		while (cnt-- > 0) {
			xx[cnt] = sc.nextInt() - 1;
			yy[cnt] = sc.nextInt() - 1;
		}
		
		updateEdges(n, xx, yy, true);
		k = sc.nextInt();
		int x = sc.nextInt();
		int ans = 0;
		firstChild = new int[n];
		firstSibling = new int[n];

		Arrays.fill(firstChild, -1);
		Arrays.fill(firstSibling, -1);
		dfs(0, -1);
		
		memo = new int[n + 1][3][x + 1];
		for (int[][] xxx : memo)
			for (int[] xxxx : xxx)
				Arrays.fill(xxxx, -1);

		for (int i = 0; i <= x; i++) {
			ans += dp(0, 0, i);
			ans = fixMod(ans);
			

		}

		System.out.println(ans);

	}

	static class Scanner {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;

		Scanner(String path) throws Exception {
			br = new BufferedReader(new FileReader(path));
		}

		Scanner() {

		}

		String next() throws Exception {

			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		int nextInt() throws Exception {
			return Integer.parseInt(next());
		}

		long nextLong() throws Exception {
			return Long.parseLong(next());
		}

		double nextDouble() throws Exception {
			return Double.parseDouble(next());
		}

	}

	static void updateEdges(int n, int[] x, int[] y, boolean both) {
		adjList = new int[n][];
		int[] deg = new int[n];
		if (both) {
			for (int xx : x)
				deg[xx]++;
			for (int yy : y)
				deg[yy]++;

			for (int i = 0; i < n; i++)
				adjList[i] = new int[deg[i]];

			for (int i = 0; i < x.length; i++) {
				adjList[x[i]][--deg[x[i]]] = y[i];
				adjList[y[i]][--deg[y[i]]] = x[i];

			}

		} else {
			for (int xx : x)
				deg[xx]++;

			for (int i = 0; i < n; i++)
				adjList[i] = new int[deg[i]];

			for (int i = 0; i < x.length; i++)
				adjList[x[i]][--deg[x[i]]] = y[i];
		}

	}

}