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.*;
import java.text.*;
import java.math.*;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.PriorityQueue;

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        int  k;
        int  x;
        long m;
        long mod = 1_000_000_007;

        public class Node {
            ArrayList<Node> e                           = new ArrayList<>();
            boolean         marked;
            long[]          numberOfOptionsWhenImNot    = new long[12];
            long[]          numberOfOptionsWhenImAm     = new long[12];
            long[]          numberOfOptionsWhenImNextTo = new long[12];

            public Node() {
                numberOfOptionsWhenImNot[0] = 1;
                numberOfOptionsWhenImNextTo[0] = 1;
                numberOfOptionsWhenImAm[0] = 0;
                numberOfOptionsWhenImAm[1] = 1;
                for (int i = 1; i < 12; i++) {
                    numberOfOptionsWhenImNot[i] = 0;
                    numberOfOptionsWhenImNextTo[i] = 0;
                    if (i != 1) {
                        numberOfOptionsWhenImAm[i] = 0;
                    }
                }
            }

            void dfs(Node parent) {
                if (marked) {
                    return;
                }
                marked = true;
                int count = 0;
                for (Node n1 : e) {
                    if (!n1.marked) {
                        count++;
                    }
                    n1.dfs(this);
                }

                for (int i = 0; i < 12; i++) {
                    numberOfOptionsWhenImNot[i] *= m - k;
                    numberOfOptionsWhenImNot[i] %= mod;
                    numberOfOptionsWhenImNextTo[i] *= k - 1;
                    numberOfOptionsWhenImNextTo[i] %= mod;
                }
                numberOfOptionsWhenImAm[0] = 0;
                if (count == 0) {
                    for (int i = 1; i < 12; i++) {
                        numberOfOptionsWhenImNot[i] = 0;
                        numberOfOptionsWhenImNextTo[i] = 0;
                        if (i != 1) {
                            numberOfOptionsWhenImAm[i] = 0;
                        }
                    }
                }
                if (parent == null)
                    return;


                for (int i = 11; i >= 0; i--) {
                    for (int j = 11 - i; j >= 0; j--) {
                        if (j != 0) {
                            parent.numberOfOptionsWhenImAm[i + j] +=
                                                                     (parent.numberOfOptionsWhenImAm[i] * numberOfOptionsWhenImNextTo[j])
                                                                         % mod;
                            parent.numberOfOptionsWhenImNextTo[i + j] +=
                                                                         (parent.numberOfOptionsWhenImNextTo[i] * ((numberOfOptionsWhenImAm[j]
                                                                                                                   + numberOfOptionsWhenImNot[j] + numberOfOptionsWhenImNextTo[j]) % mod))
                                                                             % mod;
                            parent.numberOfOptionsWhenImNot[i + j] +=
                                                                      (parent.numberOfOptionsWhenImNot[i] * ((numberOfOptionsWhenImNot[j] + numberOfOptionsWhenImNextTo[j]) % mod))
                                                                          % mod;
                        } else {
                            parent.numberOfOptionsWhenImAm[i + j] =
                                                                    (parent.numberOfOptionsWhenImAm[i] * numberOfOptionsWhenImNextTo[j])
                                                                        % mod;
                            parent.numberOfOptionsWhenImNextTo[i + j] =
                                                                        (parent.numberOfOptionsWhenImNextTo[i] * ((numberOfOptionsWhenImAm[j]
                                                                                                                  + numberOfOptionsWhenImNot[j] + numberOfOptionsWhenImNextTo[j]) % mod))
                                                                            % mod;
                            parent.numberOfOptionsWhenImNot[i + j] =
                                                                     (parent.numberOfOptionsWhenImNot[i] * ((numberOfOptionsWhenImNot[j] + numberOfOptionsWhenImNextTo[j]) % mod))
                                                                         % mod;
                        }

                        parent.numberOfOptionsWhenImNot[i + j] %= mod;
                        parent.numberOfOptionsWhenImAm[i + j] %= mod;
                        parent.numberOfOptionsWhenImNextTo[i + j] %= mod;
                    }
                }
            }
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            m = in.nextInt();
            Node[] nodes = new Node[n];
            for (int i = 0; i < n; i++)
                nodes[i] = new Node();
            for (int i = 0; i < n - 1; i++) {
                int u = in.nextInt() - 1;
                int v = in.nextInt() - 1;
                nodes[u].e.add(nodes[v]);
                nodes[v].e.add(nodes[u]);
            }
            k = in.nextInt();
            x = in.nextInt();
            nodes[0].dfs(null);
            long sum = 0;
            for (int i = 0; i <= x; i++) {
                sum += nodes[0].numberOfOptionsWhenImAm[i] + nodes[0].numberOfOptionsWhenImNextTo[i] + nodes[0].numberOfOptionsWhenImNot[i];
                sum %= mod;
            }
            out.println(sum);
        }
    }

    static class InputReader {
        public BufferedReader  reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

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

        public double nextFloat() {
            return Double.parseDouble(next());
        }

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

    }
}