#include "bits/stdc++.h"
#include<unordered_map>
#pragma warning(disable:4996)
using namespace std;
const int mod = 1000000007;
struct Mod {
public:
	int num;
	Mod() : num(0) { ; }
	Mod(long long int n) : num((n % mod + mod) % mod) { ; }
	Mod(int n) : num((n % mod + mod) % mod) { ; }
	operator int() { return num; }
};

Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }
Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }
Mod operator++(Mod &a) { return a + Mod(1); }
Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }
Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }
Mod operator--(Mod &a) { return a - Mod(1); }
Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }
Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }
Mod operator+=(Mod &a, const Mod b) { return a = a + b; }
Mod operator+=(long long int &a, const Mod b) { return a = a + b; }
Mod operator-=(Mod &a, const Mod b) { return a = a - b; }
Mod operator-=(long long int &a, const Mod b) { return a = a - b; }
Mod operator*=(Mod &a, const Mod b) { return a = a * b; }
Mod operator*=(long long int &a, const Mod b) { return a = a * b; }
Mod operator^(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = (a * a) ^ (n / 2);
	if (n % 2) res = res * a;
	return res;
}
Mod mod_pow(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = mod_pow((a * a), (n / 2));
	if (n % 2) res = res * a;
	return res;
}
Mod inv(const Mod a) { return a ^ (mod - 2); }
Mod operator/(const Mod a, const Mod b) {
	assert(b.num != 0);
	return a * inv(b);
}
Mod operator/(const long long int a, const Mod b) {
	assert(b.num != 0);
	return Mod(a) * inv(b);
}
Mod operator/=(Mod &a, const Mod b) {
	assert(b.num != 0);
	return a = a * inv(b);
}

#define MAX_MOD_N 1024000

Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];
void init() {
	fact[0] = Mod(1); factinv[0] = 1;
	for (int i = 0; i < MAX_MOD_N - 1; ++i) {
		fact[i + 1] = fact[i] * Mod(i + 1);
		factinv[i + 1] = factinv[i] / Mod(i + 1);
	}
}
Mod comb(const int a, const int b) {
	return fact[a] * factinv[b] * factinv[a - b];
}
struct Node {
	int id;
	int paid;
	vector<int>chid;
	Node(int a) :chid() {
		id = a;
		paid = -1;
	}
};
vector<Node>nodes;
map<int, Mod>getans(const int nid) {
	if (nodes[nid].chid.size() == 0) {
		const map<int, Mod>mp = { {1,1 } };
		return mp;
	}
	else if (nodes[nid].chid.size() == 1) {
		const map<int, Mod>mp(getans(nodes[nid].chid[0]));
		map<int, Mod>nmp;
		for (auto i : mp) {
			nmp[i.first + 1] = i.second;
		}
		return nmp;
	}
	else {
		map<int, Mod> now = getans(nodes[nid].chid[0]);
		for (int i = 1; i < nodes[nid].chid.size(); ++i) {
			const map<int, Mod>next = getans(nodes[nid].chid[i]);
			map<int, Mod>newmap;
			for (const auto j : now) {
				for (const auto k : next) {
					pair< int, Mod>l(j);
					pair< int, Mod>r(k);
					if (l.first < r.first) {
						swap(l, r);
					}
					assert(l.first >= r.first);
					for (int sum = l.first; sum <= l.first + r.first; ++sum) {
						const int kaburi = l.first + r.first - sum;
						const int kaburazu = sum - l.first;

						Mod ans = comb(l.first, kaburi);
						ans *= comb(l.first + kaburazu, kaburazu);
						ans *= l.second*r.second;
						newmap[sum] += ans;
					}

				}
			}
			now = newmap;
		}
		map<int, Mod>nmp;
		for (auto i : now) {
			nmp[i.first + 1] = i.second;
		}
		return nmp;
	}
}
int main() {
	init();
	int N; cin >> N;
	for (int i = 0; i < N; ++i) {
		nodes.push_back(Node(i));
	}
	for (int i = 0; i < N - 1; ++i) {
		int a, b; cin >> a >> b;
		nodes[a].chid.push_back(b);
		nodes[b].paid = a;
	}
	int root;
	for (int i = 0; i < N; ++i) {
		if (nodes[i].paid == -1) {
			root = i;
		}
	}
	map<int, Mod>ans(getans(root));
	Mod sum = 0;
	for (auto i : ans) {
		sum += i.second;
	}
	cout << sum << endl;
	return 0;
}

Measured memory_bytes: 11192