#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 998244353;

const int N = 5e3 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

int n, C[N][N], f[N][N], g[N], o[N], sz[N], ans;
vector <int> e[N];

void dfs(int u, int fa) {
  sz[u] = 1, f[u][1] = 1;
  for (int v : e[u]) if (v != fa) {
    dfs(v, u);
    rep(i, 1, sz[u]) o[i] = f[u][i], f[u][i] = 0;
    rep(i, 1, n) g[i] = 0;
    drep(i, sz[v], 0) g[i] = inc(g[i + 1], f[v][i]);
    rep(i, 1, sz[u] + sz[v]) rep(j, 1, min(i, sz[u])) {
      f[u][i] = inc(f[u][i], mul(mul(C[i - 1][j - 1], o[j]), g[i - j]));
    }
    sz[u] += sz[v];
  }
}

int main() {
  n = read();
  rep(i, 1, n - 1) {
    int u = read(), v = read();
    e[u].emplace_back(v);
    e[v].emplace_back(u);
  }
  rep(i, 0, n) C[i][0] = 1;
  rep(i, 1, n) rep(j, 1, i) C[i][j] = inc(C[i - 1][j], C[i - 1][j - 1]);
  dfs(1, 0);
  rep(i, 1, n) ans = inc(ans, f[1][i]);
  printf("%d\n", ans);
  return 0;
}