#include <vector>
const int N = 1e5;
int cnt;
std::vector<int> labels;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v);
int find_next_station(int s, int t, std::vector<int> c);
/*
clarifications:
k == n-1
c is sorted
*/
std::vector<std::vector<int>> g;
void dfs(int node, int par) {
labels[node] = cnt++;
for (int ch : g[node]) {
if (ch != par) {
dfs(ch, node);
}
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
g.clear();
g.resize(n);
cnt = 1;
for (int i = 0; i < n - 1;i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
cnt = 0;
dfs(0, -1);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
int sz = c.size();
if (t <= c[0]) return c[0];
for (int i = 1; i < sz-1; i++) {
if (t >= c[i] && t < c[i + 1]) return c[i];
}
return c[sz - 1];
}
