//#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
int t = 1;
void DFS(int node,int parent,vector<vector<int>>& adj,vector<int>& tin,int odd) {
if (odd) tin[node] = t++;
for (int nenode : adj[node]) {
if (nenode != parent) {
DFS(nenode,node,adj,tin,1 - odd);
}
}
if (!odd) tin[node] = t++;
}
vector<int>label(int n, int k, vector<int> u, vector<int> v)
{
vector<vector<int>>adj(1005);
for (int i = 0; i < n - 1; i++)
{
adj[u[i] - 1].push_back(v[i] - 1);
adj[v[i] - 1].push_back(u[i] - 1);
}
vector<int>labels(n);
t = 1;
DFS(0,0,adj,labels,1);
return labels;
}
int find_next_station(int s,int t,vector<int> c)
{
int next = -1;
sort(c.begin(), c.end());
for (int st : c) {
if (st <= t) next = st;
}
if (next == -1) next = c[0];
return next;
}
