import java.util.*;import java.io.*;import java.math.*;
public class Main{
  //↓見なくていいよ！ここから------------------------------------------
  static class InputIterator{
    ArrayList<String> inputLine = new ArrayList<String>(1024);
    int index = 0; int max;
    InputIterator(){
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      while(true){
        String read;
        try{
          read = br.readLine();
        }catch(IOException e){
          read = null;
        }
        if(read != null){
          inputLine.add(read);
        }else{
          break;
        }
      }
      max = inputLine.size();
    }
    boolean hasNext(){return (index < max);}
    String next(){
      if(hasNext()){
        String returnStr = inputLine.get(index);
        index++;
        return returnStr;
      }else{
        throw new IndexOutOfBoundsException("これ以上入力はないよ");
      }
    }
  }
  
  static InputIterator ii = new InputIterator();//リアクティブでは使えないので諦めてScanner使うこと
  static PrintWriter out = new PrintWriter(System.out);
  static void flush(){out.flush();}
  static void myout(Object t){out.println(t);}
  static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
  static String next(){return ii.next();}
  static int nextInt(){return Integer.parseInt(next());}
  static long nextLong(){return Long.parseLong(next());}
  static ArrayList<String> nextStrArray(){return myHanSpSplit(next());}
  static ArrayList<String> myHanSpSplit(String str){return new ArrayList<String>(Arrays.asList(str.split(" ")));}
  static ArrayList<String> nextCharArray(){return mySingleSplit(next());}
  static ArrayList<String> mySingleSplit(String str){return new ArrayList<String>(Arrays.asList(str.split("")));}
  static ArrayList<Integer> nextIntArray(){
    ArrayList<Integer> ret = new ArrayList<Integer>();
    ArrayList<String> input = nextStrArray();
    for(int i = 0; i < input.size(); i++){
      ret.add(Integer.parseInt(input.get(i)));
    }
    return ret;
  }
  static ArrayList<Long> nextLongArray(){
    ArrayList<Long> ret = new ArrayList<Long>();
    ArrayList<String> input = nextStrArray();
    for(int i = 0; i < input.size(); i++){
      ret.add(Long.parseLong(input.get(i)));
    }
    return ret;
  }
  static String kaigyoToStr(String[] list){return String.join("\n",list);}
  static String kaigyoToStr(ArrayList<String> list){return String.join("\n",list);}
  static String hanSpToStr(String[] list){return String.join(" ",list);}
  static String hanSpToStr(ArrayList<String> list){return String.join(" ",list);}
  public static void main(String[] args){
    Runtime rt = Runtime.getRuntime();
    long mae = System.currentTimeMillis();
    solve();
    flush();
    long ato = System.currentTimeMillis();
    myerr("time : " + (ato - mae) + "ms");
    myerr("memory : " + ((rt.totalMemory() - rt.freeMemory()) / 1024) + "KB");
  }
  //↑見なくていいよ！ここまで------------------------------------------
static Node[] list;
  static void solve(){//ここがメイン関数代わり
	ArrayList<Integer> one = nextIntArray();
	int N = one.get(0);
	int K = one.get(1);
	list = new Node[N];
	for(int i = 0; i < N; i++){
		list[i] = new Node(i);
	}
	for(int i = 0; i < N - 1; i++){
		ArrayList<Integer> tmp = nextIntArray();
		list[tmp.get(0) - 1].child.add(tmp.get(1) - 1);
		list[tmp.get(1) - 1].child.add(tmp.get(0) - 1);
	}
	long output = 1;
	int mod = 1000000007;
	list[0].access = true;
	dfs(0, K, 0, K);
	for(int i = 0; i < N; i++){
		output *= list[i].count;
		output %= mod;
	}
	myout(output);
  }
  //Method addition frame start
public static void dfs(int parentNodeCount, int color, int now, int constK){
	list[now].count = color;
	if(parentNodeCount < 2){
		parentNodeCount++;
	}
	ArrayList<Integer> child = list[now].child;
	int successCount = 0;
	for(int i = 0; i < child.size(); i++){
		if(!list[child.get(i)].access){
			list[child.get(i)].access = true;
			dfs(parentNodeCount, constK - successCount - parentNodeCount, child.get(i), constK);
			successCount++;
		}
	}
}
public static class Node{
	ArrayList<Integer> child = new ArrayList<Integer>();
	int no;
	long count = 0;
	boolean access = false;
	Node(int no){
		this.no = no;
	}
}
  //Method addition frame end
}


Measured memory_bytes: 93024