#include <bits/stdc++.h>
using namespace std;

/***** type *****/
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
template <class T> using uset = unordered_set<T>;
template <class T1, class T2> using umap = unordered_map<T1, T2>;

/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define coutld cout << fixed << setprecision(10) // cout long double
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define val(itr) *(itr)                          // get value
#define pair NyaaPair                            // nyaa pair
#define first f                                  // pair::first
#define second s                                 // pair::second
/***** const value *****/
#define llong_max 9223372036854775807            // 9 * 10^18
#define ldbl_max 1.79769e+308                    // 1.7 * 10^308
#define pi 3.1415926535897932                    // 3.14 ...
#define loop_end 9223372036854775806             // LLONG_MAX-1
/***** for each macro *****/
#define fori(i, ...) if(ll i = -1) for(__VA_ARGS__) if(i++, true)
#define each(i, e, c) fori(i, auto e = c.begin(); e != c.end(); ++e)
#define forir(i, v, ...) if(ll i=(ll)v.size())for(__VA_ARGS__)if(i--,true)
#define eachr(i, e, c) forir(i, auto e = c.rbegin(); e != c.rend(); ++e)

/***** lambda *****/
auto Count = [] // long long count value
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoN = [] // char to number
(auto c) { return (ll)(c - '0'); };
auto CeilD = [] // long double ceiling div
(auto a, auto b) { return ceil((ld)a / (ld)b); };
auto Fix = [] // fix value
(auto b, auto e, auto fix)
{ for (auto it = b; it != e; ++it) *it += fix; };
auto NtoC = [] // number to char
(auto n) { return (char)('0' + n); };
auto Pow = [] // long long pow
(auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
(auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
(auto n) { return (ll)pow(10, n); };
auto Size = []  // long long collection size
(auto& c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
(auto b, auto e) { return accumulate(b, e, 0LL); };

/***** template *****/
template <class T> void MakeVVT
(ll ys, ll xs, vvt<T>& v, T fill = T())
{	// vector<vector<T>> resize + fill
	v.resize(ys); rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T> void MakeVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fill = T())
{	// vector<vector<vector<T>>> resize + fill
	v.resize(zs); rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T> void InputVT
(ll xs, vt<T>& v, T fix = T())
{	// input vector<T> (T != struct) + fix
	v.resize(xs); rep(i, 0, xs) { cin >> v[i]; v[i] += fix; }
}
template <class T> void InputVVT
(ll ys, ll xs, vvt<T>& v, T fix = T())
{	// input vector<vector<T>> (T != struct) + fix
	MakeVVT(ys, xs, v, fix);
	rep(y, 0, ys) rep(x, 0, xs) { cin >> v[y][x]; v[y][x] += fix; }
}
template <class T> void InputVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fix = T())
{	// input vector<vector<vector<T>>> (T != struct) + fix
	v.resize(zs); rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}
template <class T1, class T2> struct NyaaPair
{	// nyaa pair template
	T1 f; T2 s;
};
template <class T1, class T2> bool operator <
(const NyaaPair<T1, T2>& l, const NyaaPair<T1, T2>& r)
{	// nyaa pair template operator <
	return (l.f != r.f) ? l.f < r.f : l.s < r.s;
}
template <class T1, class T2> bool operator >
		(const NyaaPair<T1, T2>& l, const NyaaPair<T1, T2>& r)
{	// nyaa pair template operator >
	return (l.f != r.f) ? l.f > r.f : l.s > r.s;
}

/**************************************/
/********** BEGIN OF NYA LIB **********/
/**************************************/

namespace NyaGadget {}

namespace NyaGadget
{
	/***** 数え上げライブラリ *****/

	template< typename T > struct NT_Counting
	{	// 引数にModライブラリを渡すことを想定
		vector< T > fv, fvinv, inv;

		NT_Counting(long long maxsize)
		{	// Hがn+r-1なので、vsizeをmaxsize * 2とする
			long long vsize = maxsize * 2;
			fv.resize(vsize + 1);
			fvinv.resize(vsize + 1);
			inv.resize(vsize + 1);
			fv[0] = fvinv[vsize] = inv[0] = 1;

			for (long long i = 1; i < vsize + 1; i++)
				fv[i] = fv[i - 1] * i;
			fvinv[vsize] /= fv[vsize];

			for (long long i = vsize - 1; -1 < i; i--)
				fvinv[i] = fvinv[i + 1] * (i + 1);

			for (long long i = 1; i < vsize + 1; i++)
				inv[i] = fvinv[i] * fv[i - 1];
		}

		T Factorial(long long k) { return fv[k]; }
		T FactorialInv(long long k) { return fvinv[k]; }
		T Inv(long long k) { return inv[k]; }

		T P(long long n, long long r)
		{
			if (r < 0 || n < r)
				return 0;
			return Factorial(n) * FactorialInv(n - r);
		}

		T C(long long n, long long r)
		{
			if (r < 0 || n < r)
				return 0;
			return Factorial(n) * FactorialInv(r) * FactorialInv(n - r);
		}

		T H(long long n, long long r)
		{
			if (n < 0 || r < 0)
				return 0;
			return (r == 0) ? 1 : C(n + r - 1, r);
		}

		T Catalan(long long n)
		{
			return C(2 * n, n) - C(2 * n, n - 1);
		}
	};

	template<> struct NT_Counting <long long>
	{	// modが必要ない単純な組み合わせ計算

		long long P(long long n, long long r)
		{
			if (r < 0 || n < r) return 0;

			long long res = 1;
			for (long long i = n; n - r < i; i--) res *= i;
			return res;
		}

		long long C(long long n, long long r)
		{
			if (r < 0 || n < r) return 0;

			long long res = 1;
			for (long long i = n; n - r < i; i--) res *= i;
			for (long long i = r; 0 < i; i--) res /= i;
			return res;
		}

		long long H(long long n, long long r)
		{
			if (n < 0 || r < 0) return 0;
			return (r == 0) ? 1 : C(n + r - 1, r);
		}

		long long Catalan(long long n)
		{
			return C(2 * n, n) - C(2 * n, n - 1);
		}
	};
}

namespace NyaGadget
{
	/*** MOD ライブラリ ***/

	template<long long mod> struct ModLL
	{
		long long x;

		// コンストラクタ
		ModLL() { x = 0; }
		ModLL(long long x_)
		{
			x = x_ % mod + mod;
			if (x >= mod)
				x -= mod;
		}

		// 符号
		ModLL operator + () const { return x; }
		ModLL operator - () const { return (-x < 0) ? mod - x : -x; }

		// 加減乗除演算子
		ModLL& operator += (ModLL r)
		{
			if ((x += r.x) >= mod)
				x -= mod;
			return *this;
		}
		ModLL& operator -= (ModLL r)
		{
			if ((x -= r.x) < 0)
				x += mod;
			return *this;
		}
		ModLL& operator *= (ModLL r)
		{
			x = (unsigned long long) x * r.x % mod;
			return *this;
		}
		ModLL& operator /= (ModLL r)
		{
			x = x * Inv(r.x, mod) % mod;
			return *this;
		}

		ModLL operator + (ModLL r) const { return ModLL(*this) += r; }
		ModLL operator - (ModLL r) const { return ModLL(*this) -= r; }
		ModLL operator * (ModLL r) const { return ModLL(*this) *= r; }
		ModLL operator / (ModLL r) const { return ModLL(*this) /= r; }

		// 逆元 x^{-1} (主に除算演算子で使用)
		long long Inv(long long a, long long m)
		{
			long long b = m, u = 1, v = 0;

			while (b)
			{
				long long t = a / b;
				a -= t * b; swap(a, b);
				u -= t * v; swap(u, v);
			}

			u %= m;

			return (u < 0) ? u + m : u;
		}

		// 比較演算子
		bool operator == (ModLL& r) const { return x == r.x; }
		bool operator != (ModLL& r) const { return x != r.x; }
		bool operator <  (ModLL& r) const { return x < r.x; }
		bool operator <= (ModLL& r) const { return x <= r.x; }
		bool operator >  (ModLL& r) const { return x > r.x; }
		bool operator >= (ModLL& r) const { return x >= r.x; }

		// 入出力演算子
		friend ostream& operator << (ostream& s, ModLL<mod> a)
		{
			s << a.x;
			return s;
		}
		friend istream& operator >> (istream& s, ModLL<mod>& a)
		{
			s >> a.x;
			return s;
		}

		long long Pow(long long a, long long n) {
			long long res = 1;
			while (n > 0) {
				if (n & 1) res = res * a % mod;
				a = a * a % mod;
				n >>= 1;
			}
			return res;
		}
	};
}

namespace NyaGadget
{
	/*** DFSライブラリ ***/

	struct NyaDFS
	{
		vt<ll> count;

		/**
		@brief DFS処理関数
		@param r 頂点vの根
		@param v 現在の頂点
		**/
		void Run(long long r, long long v, vector<vector<long long>>& g)
		{
			{	
                // 頂点の更新処理
			}
			for (auto& e : g[v])
			{	// 後戻りしないようにする
				if (e == r) continue;
				{
					// 辺の更新処理
					count[v]++;
				}
				Run(v, e, g);
			}
		}
	};
}

/**************************************/
/*********** END OF NYA LIB ***********/
/**************************************/

using namespace NyaGadget;
using mll = ModLL< 1000000007 >;

int main(void)
{
	ll N, K; cin >> N >> K;
	vector<vector<long long>> g(N);

	rep(i, 0, N - 1)
	{
		ll a, b; cin >> a >> b; a--, b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}

	NyaDFS dfs;
	dfs.count.resize(N);
	dfs.Run(-1, 0, g);

	mll ans = K;
	NT_Counting<mll> count(Pow10(5) + 1);
	each(i, e, dfs.count)
	{
		if (val(e) == 0) continue;
		if (i == 0)
			ans *= count.P(K - 1, val(e));
		else
			ans *= count.P(K - 2, val(e));
	}

	cout << ans;
	return 0;
}


Measured memory_bytes: 13952