#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int N=1e3+5;
vector<int>labels;
vector<vector<int>>adj;
int cnt=0;
void dfs(int node,int par){
labels[node]=cnt++;
for(auto it:adj[node])if(it!=par)dfs(it,node);
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
labels.resize(n);
adj.assign(n,{});
cnt=0;
for(int i=0;i<n-1;i++){
adj[u[i]].pb(v[i]);
adj[v[i]].pb(u[i]);
}
dfs(0,-1);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
return(s<t ? c.back():c[0]);
}
