#include "bits/stdc++.h"
#include "stations.h"
using namespace std;
vector<int> out;
vector<vector<int> > adj;
int tval;
void dfs(int node, int par){
for(auto itr: adj[node]){
if(itr == par) continue;
dfs(itr, node);
}
out[node] = tval++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
out.assign(n, 0);
adj.resize(n);
tval = 0;
for(int i = 0; i < n; i++){
adj[i].clear();
}
for(int i = 0; i < n-1; i++){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0, 0);
int now = 0;
vector<int> labels = out;
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if(c[c.size()-1] <= t) return c[c.size()-1];
auto k = *lower_bound(c.begin(), c.end(), t);
return k;
}
