#include <bits/stdc++.h>
#define rep(i,s,t) for(int i=s,__=t;i<=__;i++)
#define pre(i,s,t) for(int i=s,__=t;i>=__;i--)
#define ll long long
#define fi first
#define se second
#define ls (k<<1)
#define rs (k<<1|1)
#define mkp make_pair
#define pii pair<int,int> 
#define p_b push_back
#define all(x) x.begin(),x.end()
#define sz(x) x.size()
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
const int N=3010,mod=998244353;
using namespace std;
inline int read() {
    int s = 0, w = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9') { if(ch == '-') w = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
    return s * w;
}
int T,n,a[N];
vector<int>v[N];
int dp[N][N];
int c[N][N];
int siz[N];
int f[N];
void dfs(int x,int fa){
    siz[x]=1;
    dp[x][1]=1;
    for(auto y:v[x]){
        if(y==fa)continue;
        dfs(y,x);memset(f,0,sizeof(f));
        rep(i,1,siz[x]){
            int pre=0;
            pre(j,siz[y],1){
                pre=(pre+dp[y][j])%mod;
                f[i+j]=(f[i+j]+1ll*dp[x][i]*pre%mod*c[i+j-1][i-1])%mod;
            }
            f[i]=(f[i]+1ll*dp[x][i]*pre)%mod;
        }
        swap(f,dp[x]);
    //    rep(i,1,siz[x]+siz[y]){
     //       cout<<dp[x][i]<<" ";
     //   }puts("");
        siz[x]+=siz[y];
    }
}
void init(int n){
    rep(i,0,n){
        c[i][0]=1;
        rep(j,1,i)c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
    }
}
int ans=0;
int main() {
    cin>>n;
    init(2*n);
    rep(i,2,n){
        int x=read(),y=read();
        v[x].p_b(y);v[y].p_b(x);
    }
    dfs(1,0);
    rep(i,1,n)ans=(ans+dp[1][i])%mod;
    cout<<ans<<endl;
    return 0;
}
/*
0. Enough array size? Enough array size? Enough array size? Interger overflow?
1. Think TWICE, Code ONCE!
    Are there any counterexamples to your algo?
2. Be careful about the BOUNDARIES!
    N=1? P=1? Something about 0?
3. Do not make STUPID MISTAKES!
    Time complexity? Memory usage? Precision error?
4. Do you have some Warnings? Just have a look at them!
*/