#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define N 1005
vector<int> adj[N];
int etiket[N];
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for(int i=0;i<=n;i++){
adj[i].clear();etiket[i]=-1;
}
for (int i = 0; i < n-1; i++) {
adj[u[i]].pb(v[i]);
adj[v[i]].pb(u[i]);
}
vector<int> bir;
for(int i=0;i<n;i++){
if(adj[i].size()==1)bir.pb(i);
}
int kat=0;
for(auto x:bir){
if(etiket[x]!=-1)continue;
int cur=kat*1000+1;
int bas=x,once=-1;
while(etiket[bas]==-1&&adj[bas].size()<=2){
etiket[bas]=cur;
cur++;
for(auto u:adj[bas]){
if(u==once)continue;
once=bas;
bas=u;
break;
}
}
kat++;
}
for(int i=0;i<n;i++){
if(etiket[i]==-1)etiket[i]=1000000;
}
vector<int> labels;
for(int i=0;i<n;i++){
labels.pb(etiket[i]);
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
int x=s/1000, y=t/1000;
if(s==1000000){
for(auto u:c){
int cur=u/1000;
if(cur==y)return u;
}
}
if(x==y&&t<s){
return c[0];
}
return c[c.size()-1];
}
/*
int max_label = 0;
int r, n, k, q;
vector<int> u, v, labels, answers;
map<int, int> reverse_labels;
vector<vector<int>> adjlist;
int s, t, w;
vector<int> c;
int main() {
scanf("%d", &r);
for (int tc = 0; tc < r; tc++) {
scanf("%d%d", &n, &k) ;
u.resize(n - 1);
v.resize(n - 1);
adjlist.clear();
adjlist.resize(n);
for (int i = 0; i < n - 1; i++) {
scanf("%d%d", &u[i], &v[i]);
adjlist[u[i]].push_back(v[i]);
adjlist[v[i]].push_back(u[i]);
}
labels = label(n, k, u, v);
if ((int)labels.size() != n) {
printf("Number of labels not equal to %d\n", n);
exit(0);
}
reverse_labels.clear();
for (int i = 0; i < n; i++) {
if (labels[i] < 0 || labels[i] > k) {
printf("Label not in range 0 to %d\n", k);
exit(0);
}
if (reverse_labels.find(labels[i]) != reverse_labels.end()) {
printf("Labels not unique\n");
exit(0);
}
reverse_labels[labels[i]] = i;
if (labels[i] > max_label) {
max_label = labels[i];
}
}
assert(scanf("%d", &q) == 1);
for (int i = 0; i < q; i++) {
assert(scanf("%d%d%d", &s, &t, &w) == 3);
c.clear();
for (int v : adjlist[s]) {
c.push_back(labels[v]);
}
sort(c.begin(), c.end());
int answer = find_next_station(labels[s], labels[t], c);
if (!binary_search(c.begin(), c.end(), answer)) {
printf("Label %d returned by find_next_station not found in c\n", answer);
exit(0);
}
answers.push_back(reverse_labels[answer]);
}
}
printf("%d\n", max_label);
for (int index : answers) {
printf("%d\n", index);
}
exit(0);
}
*/
