#include <bits/stdc++.h>

const int maxn = 5e3, mod = 998244353;

std::array<int, maxn + 1> siz, tmpf;
std::array<std::array<int, maxn + 1>, maxn + 1> binom, f;
std::array<std::vector<int>, maxn + 1> g;

void dfs(int x, int fa) {
  f[x][siz[x] = 1] = 1;

  for (int v : g[x])
    if (v != fa) {
      dfs(v, x);
      std::fill_n(tmpf.data() + 1, siz[x] + siz[v], 0);
      for (int i = 1; i <= siz[x]; ++i)
        for (int j = 0; j <= siz[v]; ++j)
          tmpf[i + j] = (tmpf[i + j] + (long long)f[x][i] * f[v][j] % mod * binom[i - 1 + j][i - 1]) % mod;
      std::copy_n(tmpf.data() + 1, siz[x] += siz[v], f[x].data() + 1);
    }
  for (int i = siz[x] - 1; i >= 0; --i)
    f[x][i] = (f[x][i] + f[x][i + 1]) % mod;
}

int main() {
  #ifndef ONLINE_JUDGE
    std::freopen("QOJ5357.in", "r", stdin);
    std::freopen("QOJ5357.out", "w", stdout);
  #endif
  std::cin.tie(nullptr)->sync_with_stdio(false);

  int n;
  std::cin >> n;
  for (int i = 1, u, v; i < n; ++i) {
    std::cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }

  for (int i = 0; i <= n; ++i) {
    binom[i][0] = binom[i][i] = 1;
    for (int j = 1; j < i; ++j)
      binom[i][j] = (binom[i - 1][j - 1] + binom[i - 1][j]) % mod;
  }

  dfs(1, 0);

  std::cout << f[1][0] << std::endl;
  return 0;
}