#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "stations.h"
vector<vector<int>> arr;
vector<int> labels;
int ind;
int _n;
void dfs(int node, int lnode){
labels[node]=ind++;
for (int i = 0; i < arr[node].size(); i++){
if (arr[node][i]==lnode) continue;
dfs(arr[node][i],node);
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
_n=n;
arr.clear();
arr.resize(n);
labels.clear();
labels.resize(n,-1);
ind=0;
for (int i = 0; i < n-1; i++){
arr[u[i]].push_back(v[i]);
arr[v[i]].push_back(u[i]);
}
for (int i = 0; i < n; ++i)
{
if (arr[i].size()==1){
dfs(i,-1);
break;
}
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
for (int i = c.size()-1; i >= 1; i--){
if (t>=c[i]) return c[i];
}
return c[0];
}
