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

#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fd(i,a,b) for(int i=a;i>=b;--i)
#define ll long long

const int N = 5005, mo = 998244353;

int ksm(int x, int y) {
	int sum = 1;
	for(; y; y >>= 1, x = (ll)x * x % mo)
		if(y & 1) sum = (ll)sum * x % mo;
	return sum;
}

int n;
vector<int> e[N];
int f[N][N], siz[N];
int h[N];
int fac[N * 2], ifac[N * 2];

int binom(int x, int y) {
	return (ll)fac[x] * ifac[y] % mo * ifac[x - y] % mo;
}

void dfs(int x, int from) {
	for(int y : e[x]) if(y != from) dfs(y, x);
	memset(f[x], 0, sizeof(f[x]));
	f[x][1] = 1;
	int sz = 1;
	for(int y : e[x]) if(y != from) {
		memset(h, 0, sizeof(h));
		fo(a, 1, sz) {
			int sum = 0;
			fd(b, siz[y], 0) {
				(sum += f[y][b]) %= mo;
				(h[a + b] += (ll)f[x][a] * sum % mo * binom(a - 1 + b, b) % mo) %= mo;
			}
		}
		sz += siz[y];
		fo(a, 1, sz) f[x][a] = h[a];
	}
	siz[x] = sz;
	return;
}

int main() {
	fac[0] = 1;
	fo(i, 1, 10000) fac[i] = (ll)fac[i - 1] * i % mo;
	ifac[10000] = ksm(fac[10000], mo - 2);
	fd(i, 10000, 1) ifac[i - 1] = (ll)ifac[i] * i % mo;
	scanf("%d", &n);
	fo(i, 1, n - 1) {
		int u, v;
		scanf("%d %d", &u, &v);
		e[u].push_back(v);
		e[v].push_back(u);
	}
	dfs(1, 0);
	int ans = 0;
	fo(i, 1, n) (ans += f[1][i]) %= mo;
	printf("%d\n", ans);
	return 0;
}