#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 1010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


/*
  lca must go into subtree
  u[D]: last lca
  u[0], ..., u[D]: path from root
  T[d][j]  (0 <= d <= D): subtrees
  for d = D, ..., 0
    insert u[d] and T[d][j]
    put some at the end (lca = u[d] part)
      no adj. from the same subtree
    remaining: regard as new subtree
      if lca = u[d] part is >= 1, rightmost must not be from this new subtree
*/

int N;
vector<int> A, B;

vector<vector<int>> graph;
vector<int> sz;

// u, # remaining
Mint dp[110][110];

// # chosen, # pie block
Mint crt[2][110][110], nxt[2][110][110];
Mint f[110][110], g[110][110];

void dfs(int u, int p) {
  for (const int v : graph[u]) if (p != v) {
    dfs(v, u);
  }
  sz[u] = 1;
  for (int h = 0; h < 2; ++h) for (int k = 0; k <= sz[u]; ++k) fill(crt[h][k], crt[h][k] + (sz[u] - k + 1), 0);
  crt[0][0][1] = crt[0][1][0] = 1;
  for (const int v : graph[u]) if (p != v) {
    // use some of them and line up -> cut into PIE blocks
    for (int k = 0; k <= sz[v]; ++k) fill(f[k], f[k] + (sz[v] - k + 1), 0);
    for (int k = 0; k <= sz[v]; ++k) fill(g[k], g[k] + (sz[v] - k + 1), 0);
    for (int k = 0; k <= sz[v]; ++k) for (int a = 0; a <= sz[v] - k; ++a) f[k][a] += (fac[sz[v]] * invFac[k]) * binom((sz[v] - k) - 1, a - 1) * ((sz[v]-k-a)&1?-1:+1) * invFac[a];
    for (int k = 0; k <= sz[v]; ++k) for (int l = 0; l <= k; ++l) for (int a = 0; a <= k - l; ++a) g[l][a] += dp[v][k] * (fac[k] * invFac[l]) * binom((k - l) - 1, a - 1) * ((k-l-a)&1?-1:+1) * invFac[a];
    // conv
    for (int h = 0; h < 2; ++h) for (int k = 0; k <= sz[u] + sz[v]; ++k) fill(nxt[h][k], nxt[h][k] + (sz[u] + sz[v] - k + 1), 0);
    for (int ku = 0; ku <= sz[u]; ++ku) for (int kv = 0; kv <= sz[v]; ++kv) {
      for (int au = 0; au <= sz[u] - ku; ++au) for (int av = 0; av <= sz[v] - kv; ++av) {
        nxt[0][ku + kv][au + av] += crt[0][ku][au] * f[kv][av];
        nxt[1][ku + kv][au + av] += crt[1][ku][au] * f[kv][av];
        nxt[1][ku + kv][au + av] += crt[0][ku][au] * g[kv][av];
        // ban rightmost
        if (av) nxt[1][ku + kv][au + av - 1] -= crt[0][ku][au] * g[kv][av] * av;
      }
    }
    for (int h = 0; h < 2; ++h) for (int k = 0; k <= sz[u] + sz[v]; ++k) copy(nxt[h][k], nxt[h][k] + (sz[u] + sz[v] - k + 1), crt[h][k]);
    sz[u] += sz[v];
  }
  // start
  for (int k = 0; k <= sz[u] - 2; ++k) for (int a = 0; a <= sz[u] - k; ++a) if (crt[0][k][a]) {
// cerr<<__LINE__<<": "<<u<<"; "<<k<<" "<<a<<": "<<crt[0][k][a]<<" "<<fac[a]<<endl;
    dp[u][k] += crt[0][k][a] * fac[a];
  }
  // continue
  for (int k = 0; k <= sz[u]; ++k) for (int a = 0; a <= sz[u] - k; ++a) if (crt[1][k][a]) {
// cerr<<__LINE__<<": "<<u<<"; "<<k<<" "<<a<<": "<<crt[1][k][a]<<" "<<fac[a]<<endl;
    dp[u][k] += crt[1][k][a] * fac[a];
  }
// cerr<<"dp["<<u<<"] = ";pv(dp[u],dp[u]+(sz[u]+1));
}

int main() {
  prepare();
  
  for (; ~scanf("%d", &N); ) {
    A.resize(N - 1);
    B.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    
    graph.assign(N, {});
    for (int i = 0; i < N - 1; ++i) {
      graph[A[i]].push_back(B[i]);
      graph[B[i]].push_back(A[i]);
    }
    sz.assign(N, 0);
    memset(dp, 0, sizeof(dp));
    dfs(0, -1);
    printf("%u\n", dp[0][0].x);
  }
  return 0;
}