const int MAXN = 705;
vector<vector<int>> tree;
int n;
long long dp[MAXN][MAXN];
int size[MAXN];
void dfs(int u, int parent) {
size[u] = 1;
dp[u][1] = 1;
for (int v : tree[u]) {
if (v == parent) continue;
dfs(v, u);
}
int main() {
cin >> n;
tree.resize(n + 1);
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
tree[u].push_back(v);
tree[v].push_back(u);
}
}
