#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;
constexpr int N = 5e5, M = 20;
int n, st[N + 3][M];
int h[N + 3];
struct edge {
	int u, v;
} e[N + 3];
int main() {
	freopen("query.in", "r", stdin);
	freopen("query.out", "w", stdout);
	scanf("%d", &n);
	for(int i = 1, u, v; i < n; i++) {
		scanf("%d", &u, &v);
	}
	return 0;
}

