Problem: You are given a tree of n vertices. You are to select k (not necessarily distinct) simple paths in such a way that it is possible to split all edges of the tree into three sets: edges not contained in any path, edges that are a part of exactly one of these paths, and edges that are parts of all selected paths, and the latter set should be non-empty.

Compute the number of ways to select k paths modulo 998244353.

The paths are enumerated, in other words, two ways are considered distinct if there are such i (1 ≤ i ≤ k) and an edge that the i-th path contains the edge in one way and does not contain it in the other.

Input

The first line contains two integers n and k (1 ≤ n, k ≤ 10^{5}) — the number of vertices in the tree and the desired number of paths.

The next n - 1 lines describe edges of the tree. Each line contains two integers a and b (1 ≤ a, b ≤ n, a ≠ b) — the endpoints of an edge. It is guaranteed that the given edges form a tree.

Output

Print the number of ways to select k enumerated not necessarily distinct simple paths in such a way that for each edge either it is not contained in any path, or it is contained in exactly one path, or it is contained in all k paths, and the intersection of all paths is non-empty. 

As the answer can be large, print it modulo 998244353.

Examples

Input

3 2
1 2
2 3


Output

7


Input

5 1
4 1
2 3
4 5
2 1


Output

10


Input

29 29
1 2
1 3
1 4
1 5
5 6
5 7
5 8
8 9
8 10
8 11
11 12
11 13
11 14
14 15
14 16
14 17
17 18
17 19
17 20
20 21
20 22
20 23
23 24
23 25
23 26
26 27
26 28
26 29


Output

125580756

Note

In the first example the following ways are valid：

  * ((1,2), (1,2)), 
  * ((1,2), (1,3)), 
  * ((1,3), (1,2)), 
  * ((1,3), (1,3)), 
  * ((1,3), (2,3)), 
  * ((2,3), (1,3)), 
  * ((2,3), (2,3)). 



In the second example k=1, so all n ⋅ (n - 1) / 2 = 5 ⋅ 4 / 2 = 10 paths are valid.

In the third example, the answer is ≥ 998244353, so it was taken modulo 998244353, don't forget it!

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using cat = long long;
unsigned long long MOD = 998244353LL;
unsigned long long pw(unsigned long long a, unsigned long long e) {
  if (e <= 0) return 1;
  unsigned long long x = pw(a, e / 2);
  x = (x * x) % MOD;
  if (e % 2 != 0) x = (x * a) % MOD;
  return x;
}
unsigned long long proot = 3;
vector<vector<unsigned long long> > OM;
vector<unsigned long long> DEP;
vector<unsigned long long> DFT(vector<unsigned long long> &A, int N, int d,
                               int x, int dir) {
  vector<unsigned long long> ret(N, 0);
  if (N == 1) {
    ret[0] = A[x];
    return ret;
  }
  if (N == 2) {
    ret[0] = (A[x] + A[x + d]) % MOD;
    ret[1] = (A[x] + MOD - A[x + d]) % MOD;
    return ret;
  }
  int dep = DEP[N];
  vector<unsigned long long> DFT0[2];
  DFT0[0] = DFT(A, N / 2, d * 2, x, dir);
  DFT0[1] = DFT(A, N / 2, d * 2, x + d, dir);
  for (int i = 0; i < N / 2; i++) {
    unsigned long long com = OM[dep][(N + dir * i) % N];
    ret[i] = (DFT0[0][i] + com * DFT0[1][i]) % MOD;
    ret[i + N / 2] = (DFT0[0][i] + (MOD - com) * DFT0[1][i]) % MOD;
  }
  return ret;
}
int SN = 1 << 20;
vector<unsigned long long> convolution(vector<unsigned long long> A,
                                       vector<unsigned long long> B) {
  if ((int)A.size() < 50) {
    vector<unsigned long long> ret(A.size() * 2 - 1);
    unsigned long long mod2 = MOD * MOD * 4;
    for (int i = 0; i < (int)A.size(); i++)
      for (int j = 0; j < (int)B.size(); j++) {
        ret[i + j] += A[i] * B[j];
        if (ret[i + j] >= mod2) ret[i + j] -= mod2;
      }
    for (int i = 0; i < (int)ret.size(); i++) ret[i] %= MOD;
    return ret;
  }
  int Smin = 1;
  while (Smin < (int)A.size() * 2) Smin *= 2;
  if (OM.empty()) {
    OM.resize(21);
    for (int i = 0; i < 21; i++) {
      unsigned long long root = pw(proot, (MOD - 1) / (1 << i));
      OM[i].resize(1 << i, 1);
      for (int j = 1; j < (1 << i); j++) OM[i][j] = (OM[i][j - 1] * root) % MOD;
      reverse(begin(OM[i]) + 1, end(OM[i]));
    }
    DEP.resize(SN + 1);
    for (int i = 1; i <= SN; i++) {
      int dep = 0, n = i;
      while (n > 1) n /= 2, dep++;
      DEP[i] = dep;
    }
  }
  A.resize(Smin, 0);
  B.resize(Smin, 0);
  vector<unsigned long long> FA = DFT(A, A.size(), 1, 0, 1);
  vector<unsigned long long> FB = DFT(B, B.size(), 1, 0, 1);
  vector<unsigned long long> Fret(FA.size(), 0);
  for (unsigned int i = 0; i < FA.size(); i++) Fret[i] = (FA[i] * FB[i]) % MOD;
  vector<unsigned long long> ret = DFT(Fret, Fret.size(), 1, 0, -1);
  unsigned long long inv = pw(ret.size(), MOD - 2);
  for (unsigned int i = 0; i < ret.size(); i++) ret[i] = (ret[i] * inv) % MOD;
  ret.resize(A.size() * 2 - 1);
  return ret;
}
vector<cat> poly_prod(vector<cat> V, int K, cat mod) {
  int N = V.size();
  if (N <= 10) {
    vector<cat> ret(min(K + 1, N + 1), 0);
    ret[0] = 1;
    for (int i = 0; i < N; i++)
      for (int j = min(K, i + 1); j > 0; j--)
        ret[j] = (ret[j] + ret[j - 1] * V[i]) % mod;
    return ret;
  }
  vector<cat> Vl, Vr;
  for (int i = 0; i < N / 2; i++) Vl.push_back(V[i]);
  for (int i = N / 2; i < N; i++) Vr.push_back(V[i]);
  vector<cat> Pl = poly_prod(Vl, K, mod), Pr = poly_prod(Vr, K, mod);
  vector<unsigned long long> Rl(min(K + 1, (int)max(Pl.size(), Pr.size())), 0);
  vector<unsigned long long> Rr(min(K + 1, (int)max(Pl.size(), Pr.size())), 0);
  for (int i = 0; i < min(K + 1, (int)Pl.size()); i++) Rl[i] = Pl[i];
  for (int i = 0; i < min(K + 1, (int)Pr.size()); i++) Rr[i] = Pr[i];
  vector<unsigned long long> R = convolution(Rl, Rr);
  vector<cat> ret(min(K + 1, N + 1), 0);
  for (int i = 0; i < min(K + 1, N + 1); i++) ret[i] = R[i];
  return ret;
}
vector<cat> poly_rem(vector<cat> &P, vector<cat> Q, cat mod) {
  vector<cat> ret = P;
  while (ret.size() >= Q.size()) {
    cat x = ret.back();
    for (int i = 0; i < (int)Q.size(); i++)
      ret[ret.size() - Q.size() + i] =
          (ret[ret.size() - Q.size() + i] - x * Q[i]) % mod;
    while ((int)ret.size() > 1 && ret.back() == 0) ret.pop_back();
  }
  return ret;
}
class poly_eval_tree {
  vector<cat> X;
  vector<vector<cat> > Q;
  vector<vector<int> > son;
  cat mod;
  void build_tree(int l, int r, int cur) {
    if (r - l <= 10) {
      Q[cur].resize(r - l + 1, 0);
      Q[cur][0] = 1;
      for (int i = l; i < r; i++)
        for (int j = i - l + 1; j >= 0; j--)
          Q[cur][j] = (((j == 0) ? 0 : Q[cur][j - 1]) - X[i] * Q[cur][j]) % mod;
      for (int i = 0; i <= r - l; i++)
        if (Q[cur][i] < 0) Q[cur][i] += mod;
      return;
    }
    son[cur][0] = son.size();
    son.push_back(vector<int>(2, -1));
    Q.push_back(vector<cat>());
    build_tree(l, (l + r) / 2, son[cur][0]);
    son[cur][1] = son.size();
    son.push_back(vector<int>(2, -1));
    Q.push_back(vector<cat>());
    build_tree((l + r) / 2, r, son[cur][1]);
    vector<unsigned long long> Ql(
        max(Q[son[cur][0]].size(), Q[son[cur][1]].size()), 0);
    for (int i = 0; i < (int)Q[son[cur][0]].size(); i++)
      Ql[i] = Q[son[cur][0]][i];
    vector<unsigned long long> Qr(
        max(Q[son[cur][0]].size(), Q[son[cur][1]].size()), 0);
    for (int i = 0; i < (int)Q[son[cur][1]].size(); i++)
      Qr[i] = Q[son[cur][1]][i];
    vector<unsigned long long> C = convolution(Ql, Qr);
    int sz = Q[son[cur][0]].size() + Q[son[cur][1]].size() - 1;
    Q[cur].resize(sz);
    for (int i = 0; i < sz; i++) Q[cur][i] = C[i];
  }

 public:
  poly_eval_tree(vector<cat> X, cat mod) : X(X), mod(mod) {
    son.reserve(2 * X.size() + 10);
    son.push_back(vector<int>(2, -1));
    Q.reserve(2 * X.size() + 10);
    Q.push_back(vector<cat>());
    build_tree(0, X.size(), 0);
  }
  vector<cat> eval(vector<cat> &P, int l, int r, int cur = 0) {
    int N = P.size();
    if (N <= 10 || son[cur][0] == -1) {
      vector<cat> ret(r - l, 0);
      for (int j = l; j < r; j++)
        for (int i = N - 1; i >= 0; i--)
          ret[j - l] = (ret[j - l] * X[j] + P[i]) % mod;
      return ret;
    }
    vector<cat> Pl = poly_rem(P, Q[son[cur][0]], mod);
    vector<cat> Pr = poly_rem(P, Q[son[cur][1]], mod);
    vector<cat> retl = eval(Pl, l, (l + r) / 2, son[cur][0]);
    vector<cat> retr = eval(Pr, (l + r) / 2, r, son[cur][1]);
    for (auto it = retr.begin(); it != retr.end(); it++) retl.push_back(*it);
    return retl;
  }
};
vector<cat> poly_eval_dedup(vector<cat> P, vector<cat> X, cat mod) {
  int x = X.size();
  vector<pair<cat, int> > Xs(x);
  for (int i = 0; i < x; i++) Xs[i] = {X[i], i};
  sort(begin(Xs), end(Xs));
  vector<cat> Xu;
  for (int i = 0; i < x; i++)
    if (i == 0 || Xs[i].first != Xs[i - 1].first) Xu.push_back(Xs[i].first);
  poly_eval_tree T(Xu, mod);
  vector<cat> ret_dedup = T.eval(P, 0, Xu.size());
  int a = 0;
  vector<cat> ret(x);
  for (int i = 0; i < x; i++)
    if (i == 0 || Xs[i].first != Xs[i - 1].first) {
      for (int j = i; j < x; j++) {
        if (Xs[j].first != Xs[i].first) break;
        ret[Xs[j].second] = ret_dedup[a];
      }
      a++;
    }
  return ret;
}
void DFS(int R, vector<vector<int> > &G, vector<int> &par, vector<cat> &S) {
  S[R] = 1;
  for (auto it = G[R].begin(); it != G[R].end(); it++)
    if (par[*it] == -1) {
      par[*it] = R;
      DFS(*it, G, par, S);
      S[R] += S[*it];
    }
}
void DFS2(int R, vector<vector<int> > &G, vector<int> &par, vector<cat> &val,
          vector<cat> &sum_val, cat mod) {
  sum_val[R] = val[R];
  for (auto it = G[R].begin(); it != G[R].end(); it++)
    if (par[*it] == R) {
      DFS2(*it, G, par, val, sum_val, mod);
      sum_val[R] += sum_val[*it];
    }
  sum_val[R] %= mod;
}
cat pw(cat a, cat e, cat mod) {
  if (e <= 0) return 1;
  cat x = pw(a, e / 2);
  x = x * x % mod;
  if (e & 1) x = x * a % mod;
  return x;
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(10);
  int N, K;
  cin >> N >> K;
  cat mod = 998244353;
  if (K == 1) {
    cout << 1LL * N * (N - 1) / 2 % mod << "\n";
    return 0;
  }
  vector<vector<int> > G(N);
  for (int i = 0; i < N - 1; i++) {
    int u, v;
    cin >> u >> v;
    G[--u].push_back(--v);
    G[v].push_back(u);
  }
  vector<int> par(N, -1);
  vector<cat> S(N);
  par[0] = 0;
  DFS(0, G, par, S);
  vector<cat> inv(K + 1, 1);
  for (int i = 1; i <= K; i++) inv[i] = inv[i - 1] * pw(i, mod - 2, mod) % mod;
  cat fac = 1;
  for (int i = 1; i <= K; i++) fac = fac * i % mod;
  vector<cat> cntK_down(N, 0), cntK_up(N, 0);
  for (int i = 0; i < N; i++) {
    vector<cat> V(G[i].size());
    for (int j = 0; j < (int)G[i].size(); j++) {
      if (par[G[i][j]] == i)
        V[j] = S[G[i][j]];
      else
        V[j] = N - S[i];
    }
    vector<cat> P = poly_prod(V, K, mod);
    int sz = P.size();
    vector<unsigned long long> Pu(sz, 0), Iu(sz, 0);
    for (int j = 0; j < sz; j++) Pu[j] = P[j];
    for (int j = 0; j < sz; j++) Iu[j] = inv[K + 1 - sz + j];
    vector<unsigned long long> C = convolution(Pu, Iu);
    for (int j = 0; j < sz; j++) P[j] = C[sz - 1 - j];
    vector<cat> X(V.size());
    for (int j = 0; j < (int)V.size(); j++) X[j] = (mod - V[j]) % mod;
    vector<cat> val = poly_eval_dedup(P, X, mod);
    for (int j = 0; j < (int)V.size(); j++) {
      cat val_cur = val[j];
      if (par[G[i][j]] == i)
        cntK_up[G[i][j]] = val_cur * fac % mod;
      else
        cntK_down[i] = val_cur * fac % mod;
    }
  }
  vector<cat> sum_val(N);
  DFS2(0, G, par, cntK_down, sum_val, mod);
  cat ans = 0;
  for (int i = 0; i < N; i++) {
    cat sum = 0;
    for (auto it = G[i].begin(); it != G[i].end(); it++)
      if (par[*it] == i) {
        ans += sum_val[*it] * (sum + cntK_up[*it]) % mod;
        sum = (sum + sum_val[*it]) % mod;
      }
  }
  ans %= mod;
  if (ans < 0) ans += mod;
  cout << ans << "\n";
  return 0;
}