#include<iostream>
#include<stdio.h>
#include<ctype.h>
#include<vector>
#include<string.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pii pair<int,int>
#define lowbit(x) ((x)&-(x))
#define popcount(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define umap unordered_map
#define all(x) x.begin(),x.end()
#define mk make_pair
#define pb push_back
#define ckmax(x,y) x=max(x,y)
#define ckmin(x,y) x=min(x,y)
#define rep(i,l,r) for(int i=l;i<=r;++i)
#define per(i,r,l) for(int i=r;i>=l;--i)
#define N 5005
#define int long long
using namespace std;
inline int read(){
	int x=0,f=0; char ch=getchar();
	while(!isdigit(ch)) f|=(ch==45),ch=getchar();
	while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}
const int mo=998244353;
inline void red(int &x){x>=mo?x-=mo:0;}
int n,C[N][N],f[N][N],sze[N];
vector<int> G[N];
void dfs(int u,int fa){
	for(int v:G[u]){
		if(v==fa) continue;
		dfs(v,u);
	}
	sze[u]=1;
	f[u][1]=1;
	for(int v:G[u]){
		if(v==fa) continue;
		memcpy(f[0],f[u],sizeof(f[u]));
		memset(f[u],0,sizeof(f[u]));
		for(int i=1;i<=sze[u];++i){
			for(int j=0;j<=sze[v];++j){
				red(f[u][i+j]+=f[0][i]*f[v][j]%mo*C[i+j-1][i-1]%mo);
			}
		}
		sze[u]+=sze[v];
	}
	for(int i=sze[u];i>=0;--i) red(f[u][i]+=f[u][i+1]);
}
signed main(){
	n=read();
	C[0][0]=1;
	for(int i=1;i<=n;++i){
		C[i][0]=1;
		for(int j=1;j<=i;++j){
			red(C[i][j]=C[i-1][j]+C[i-1][j-1]);
		}
	}
	for(int i=1;i<n;++i){
		int x=read(),y=read();
		G[x].pb(y),G[y].pb(x);
	}
	dfs(1,0);
	cout<<f[1][0];
	return 0;
}