#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <cstdint>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
const ll INFL = 1LL << 60;//10^18 = 2^60
ll MOD = 1000000007;
//ll MOD = 998244353;
//vector<mint> dp(N, Mint);
//vector<vector<mint>> dp2(N, vector<mint>(N, Mint));
//vector<vector<vector<mint>>> dp3(N, vector<vector<mint>>(N, vector<mint>(N, Mint)));
struct mint{
  ll x;
  mint(ll x=0):x(x % MOD){}
  mint& operator+=(const mint a){
    (x += a.x) %= MOD;
    return *this;
  }
  mint& operator-=(const mint a){
    (x += MOD-a.x) %= MOD;
    return *this;
  }
  mint& operator*=(const mint a){
    (x *= a.x) %= MOD;
    return *this;
  }
  mint& operator%=(const mint a){
    (x %= a.x);
    return *this;
  }
  mint& operator++ (int){
    (x += 1) %= MOD;
    return *this;
  }
  mint& operator-- (int){
    (x += MOD-1) %= MOD;
    return *this;
  }
  mint operator+(const mint a) const{
    mint res(*this);
    return res+=a;
  }
  mint operator-(const mint a) const{
    mint res(*this);
    return res-=a;
  }
  mint operator*(const mint a) const{
    mint res(*this);
    return res*=a;
  }
  mint operator%(const mint a) const{
    mint res(*this);
    return res%=a;
  }
  mint po(ll t) const{
    if(!t) return 1;
    mint a = po(t>>1);
    a *= a;
    if(t&1) a *= *this;
    return a;
  }
  mint inverse() const{
    return po(MOD-2);
  }
  mint& operator/=(const mint a){
    return (*this) *= a.inverse();
  }
  mint operator/(const mint a) const{
    mint res(*this);
    return res/=a;
  }
  bool operator == (const mint a){
    return this->x == a.x;
  }
  bool operator != (const mint a){
    return this->x != a.x;
  }
  void get(){
    cout << x << endl;
  }
  void ge(){
    cout << x << " ";
  }
};const mint Mint = 0;

mint pow_mod(ll x, ll k){
  mint res = 1;
  mint a = x;
  while(k > 0){
    if(k % 2){
      res *= a;
    }
    a *= a;
    k /= 2;
  }
  return res;
}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

mint inverse(ll x){return pow_mod(x, MOD-2);}

//二項演算
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
mint comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    mint res = fac[n];
    res *= finv[k] * finv[n-k];
    return res;
}
mint comb_naive(ll N, ll K){//Kが小さい時
  mint res = 1;
  rep(i, K) res *= (N-i);
  mint k = 1;

  rep(i, K) k *= (i+1);
  res /= k;
  return res;
}
//第二種スターリング数
const ll MAXStir2 = 3010;
vector<vector<mint>> Stir2memo(MAXStir2, vector<mint>(MAXStir2, Mint));
vector<mint> Bellmemo(MAXStir2, Mint);
void Stir2init(){
  Stir2memo[0][0] = 1;
  rep(i, MAXStir2-1)rep(j, i+1)Stir2memo[i+1][j+1] = Stir2memo[i][j] + Stir2memo[i][j+1] * (j+1);
  rep(i, MAXStir2){
    Bellmemo[i] = 0;
    rep(j,i+1) Bellmemo[i] += Stir2memo[i][j];
  }
}
mint Stir2(ll i, ll j){//区別できるi個をjグループに分ける場合の数
  if(i < 0 || j < 0 || i < j) return 0;
  return Stir2memo[i][j];
}
mint Bell(ll x){//区別できるx個をグループ分けする方法全ての場合の数
  if(x < 0) return 0;
  return Bellmemo[x];
}

mint kai_memo[100010];
mint kai_mod(ll K){
  if(K < 0) return 0;
  if(K == 0) return 1;
  if(kai_memo[K] != 0) return kai_memo[K];
  return kai_memo[K] = kai_mod(K-1) * K;
}
mint kai_kai_memo[100010];
mint kai_kai_mod(ll K){
  if(K == 0) return 1;
  if(K == 1) return 1;
  if(kai_kai_memo[K] != 0) return kai_kai_memo[K];
  return kai_kai_memo[K] = kai_kai_mod(K-2) * K;
}

//約数の列挙O(√n)
vector<ll> divisor(ll n){
    vector<ll> res(0);
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i != n/i) res.push_back(n/i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

ll memoG[5010];
ll N;
vector<ll> E[5010];
ll memo[5010];
ll size(ll now, ll from){
  if(memo[now] != -1) return memo[now];
  ll res = 1;
  for(ll to : E[now]){
    if(to == from) continue;
    res += size(to, now);
  }
  return memo[now] = res;
}

ll dp[5010][5010][2];
ll tmp[5010][2];//頂点数、切った辺の本数
ll Next[5010][2];//頂点数、切った辺の本数
void calc(ll now, ll from){
  for(ll to: E[now]){
    if(to == from) continue;
    calc(to, now);
  }
  ll X = 1;
  ll n = size(now, from);
  rep(i, n+1) tmp[i][0] = tmp[i][1] = 0;
  rep(i, n+1) Next[i][0] = Next[i][1] = 0;
  tmp[1][0] = 1;
  for(ll to: E[now]){
    if(to == from) continue;
    ll Y = size(to, now);
    rep(i, X+1)rep(j, Y+1){
      if(i == 0 || j == 0) continue;
      //くっつける
      Next[i+j][0] += tmp[i][0] * dp[to][j][0] + tmp[i][1] * dp[to][j][1];
      Next[i+j][0] %= MOD;
      Next[i+j][1] += tmp[i][0] * dp[to][j][1] + tmp[i][1] * dp[to][j][0];
      Next[i+j][1] %= MOD;
      //きる
      Next[i][0] += tmp[i][0] * dp[to][j][1] % MOD * memoG[j] + tmp[i][1] * dp[to][j][0] % MOD * memoG[j];
      Next[i][0] %= MOD;
      Next[i][1] += tmp[i][0] * dp[to][j][0] % MOD * memoG[j] + tmp[i][1] * dp[to][j][1] % MOD * memoG[j];
      Next[i][1] %= MOD;
    }

    X += Y;
    rep(i, X+1)rep(j, 2) tmp[i][j] = Next[i][j];
    rep(i, X+1)rep(j, 2) Next[i][j] = 0;
  }
  rep(i, X+1)rep(j, 2) dp[now][i][j] = tmp[i][j];
  return;
}


int main(){
  rep(i, 5010) memo[i] = -1;
  memoG[2] = 1;
  for(ll i = 4; i < 5010; i += 2) memoG[i] = memoG[i-2] * (i-1) % MOD;
  cin >> N;
  rep(i, N-1){
    ll x, y;
    cin >> x >> y;
    x--, y--;
    E[x].pb(y);
    E[y].pb(x);
  }
  calc(0, -1);
  mint ans = 0;
  rep(i, N+1)rep(j, 2){
    if(i == 0) continue;
    if(j % 2) ans -= dp[0][i][j] * memoG[i];
    else ans += dp[0][i][j] * memoG[i];
  }
  ans.get();
}


Measured memory_bytes: 466048