#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)a.size()
#define all(a) (a.begin(), a.end())
vector<vector<int>> neigh;
vector<int> labels;
int tim=0;
void dfs(int x,int p){
labels[x]=1000*tim;
for (auto u : neigh[x])
{
if(u==p) continue;
dfs(u,x);
}
labels[x]+=tim++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
labels.resize(n);
neigh.resize(n);
for (int i = 0; i < n-1; i++)
{
neigh[u[i]].push_back(v[i]);
neigh[v[i]].push_back(u[i]);
}
dfs(0,-1);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
t%=1000;
int p=-1;
for (auto u : c)
{
if(u%1000>s%1000) p=u;
if(t>=u/1000&&t<=u%1000) return u;
}
return p;
}
