#include <bits/stdc++.h>
#include "stations.h"
using namespace std;
vector<int> w, a;
vector<vector<int>> g;
void dfs(int u, int p) {
w[u] = 1;
a.push_back(u);
for (auto v : g[u]) {
if (v != p) {
dfs(v, u);
w[u] += w[v];
}
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
a.clear();
g.assign(n, {});
w.assign(n, 0);
for (int i = 0; i < n - 1; i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
dfs(0, -1);
vector<int> ret(n);
for (int i = 0; i < n; i++) {
ret[a[i]] = i * 1000 + w[i];
}
return ret;
}
bool is(int x, int y) {
int u = x / 1000, w_u = x % 1000;
int v = y / 1000, v_u = y % 1000;
return u + w_u >= v;
}
int find_next_station(int s, int t, vector<int> c) {
if (is(s, t)) {
for (auto x : c) {
if (is(x, t) && x > s) {
return x;
}
}
}
return c[0];
}
