#include <bits/stdc++.h>
 
//#include <unistd.h>
//#include <iostream>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


const int MAXN = 10010;

vl fact(MAXN);
vl rfact(MAXN);

ll mod_pow(ll x, ll p, ll M = MOD) {
  ll a = 1;
  while (p) {
    if (p % 2)
      a = a*x%M;
    x = x*x%M;
    p /= 2;
  }
  return a;
}

ll mod_inverse(ll a, ll M = MOD) {
  return mod_pow(a, M - 2, M);
}

void set_fact(ll n, ll M = MOD) {
  fact[0] = fact[1] = rfact[0] = rfact[1] = 1;
  for (ll i = 2; i <= n; i++) {
    fact[i] = i * fact[i - 1] % M;
    // rfact[i] = mod_inverse(fact[i], M);
  }
}

//http://drken1215.hatenablog.com/entry/2018/06/08/210000
//n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ��ď����Ă���
ll nCr(ll n, ll r, ll M = MOD) {
  if (r > n) return 0;
  assert(fact[2] == 2);
  ll ret = fact[n];
  if (rfact[r] == 0) {
    rfact[r] = mod_inverse(fact[r], M);
  }
  ret = (ret*rfact[r]) % M;
  if (rfact[n - r] == 0) {
    rfact[n - r] = mod_inverse(fact[n - r], M);
  }
  ret = (ret*rfact[n - r]) % M;
  return ret;
}

ll nHr(ll n, ll r) {
  return nCr(n+r-1, r);
}

vll G;
vl fact2;

ll dp[5001][5001][2];
ll dp2[5001][5001][2];

int dfs(int now, int par) {
  int all_num = 1;
  vi nums;
  int cnt = 0;
  for (int ch: G[now]) {
    if (ch == par) continue;
    nums.push_back(dfs(ch, now));
    all_num += nums.back();
    cnt++;
  }

  rep (i, cnt + 1) rep (j, all_num + 1) rep (k, 2) dp2[i][j][k] = 0;

  cnt = 0;
  dp2[0][1][0] = 1;
  int sub_num = 1;

  for (int ch: G[now]) {
    if (ch == par) continue;
    for (int i2 = 0; i2 <= sub_num; i2++) {
      rep (j2, 2) {
        rep (i3, nums[cnt] + 1) {
          rep (j3, 2) {
            // kiru
            dp2[cnt + 1][i2][(j2 + j3 + 1) % 2] += dp2[cnt][i2][j2] * dp[ch][i3][j3] % MOD * fact2[i3 - 1] % MOD;
            dp2[cnt + 1][i2][(j2 + j3 + 1) % 2] %= MOD;
            // tsunagu
            dp2[cnt + 1][i2 + i3][(j2 + j3) % 2] += dp2[cnt][i2][j2] * dp[ch][i3][j3] % MOD;
            dp2[cnt + 1][i2 + i3][(j2 + j3) % 2] %= MOD;
          }
        }
      }
    }
    sub_num += nums[cnt];
    cnt++;
  }
  assert(all_num == sub_num);
  for (int i = 0; i <= sub_num; i++) {
    rep (k, 2) {
      dp[now][i][k] = dp2[cnt][i][k];
    }
  }
  return sub_num;
}

signed main() {
    fio();
    int n;
    cin >> n;
    set_fact(n + 1);
    G.resize(n);
    fact2.resize(5000 + 1);
    fact2[0] = 0;
    fact2[1] = 1;
    for (int i = 2; i <= 5000; i++) {
        fact2[i] = i * fact2[i - 2] % MOD;
    }
    vi x(n), y(n);
    rep (i, n - 1) {
        cin >> x[i] >> y[i];
        x[i]--; y[i]--;
        G[x[i]].push_back(y[i]);
        G[y[i]].push_back(x[i]);
    }

    dfs(0, -1);

    rep (j, 5001) {
      rep (k, 2) {
        (dp[0][j][k] *= fact2[j - 1]) %= MOD;
      }
    }

    vl sum(2);
    rep (i, 2) {
      rep (j, 5001) {
        (sum[i] += dp[0][j][i]) %= MOD;
      }
    }

    ll ans = (sum[0] - sum[1] + MOD) % MOD;
    cout << ans << endl;
}


Measured memory_bytes: 781312