// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
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;}

vector<int> child[100001], edge[100001];
bool used[100001];

void dfs(int i){
  used[i] = true;
  for(auto c: edge[i]){
    if(!used[c]){
      child[i].pb(c);
      dfs(c);
    }
  }
}

template <typename T>
T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while(tmp){
    if(tmp % 2 == 1){
      res = (T)((ll)res * curr % mod);
    }
    curr = (T)((ll)curr * curr % mod);
    tmp >>= 1;
  }
  return res;
}

ll fac[100001];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  rep(i, n - 1){
    int a, b;
    cin >> a >> b, a--, b--;
    edge[a].pb(b);
    edge[b].pb(a);
  }
  dfs(0);
  int k = 0;
  for(int i = 0; i < n; i++){
    if(sz(child[i]) == 0)k++;
  }

  fac[0] = 1;
  for(int i = 1; i <= n; i++)fac[i] = i * fac[i-1] % mod;

  ll res = power<ll>(k, mod - 2, mod);
  res = res * fac[n - 2] % mod;
  res = res * power<ll>(fac[k-1], mod - 2, mod) % mod;
  res = res * power<ll>(fac[n-k-1], mod - 2, mod) % mod;
  res = res * fac[n-1] % mod;
  res = res * power<ll>(fac[k-1], mod - 2, mod) % mod;
  res = res * power<ll>(fac[n-k], mod - 2, mod) % mod;
  cout << res << endl;
	return 0;
}