#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "stations.h"
VVI gp;
VI ret;
int last;
void dfs(int u, int p = -1) {
ret[u] = last++;
for (int v : gp[u]) if (v != p) dfs(v, u);
}
VI label(int n, int k, VI U, VI V) {
gp = VVI(n);
rep(i, n-1) {
int u = U[i];
int v = V[i];
gp[u].pb(v);
gp[v].pb(u);
}
ret = VI(n);
last = 0;
rep(u, n) if (gp[u].size() == 1) {
dfs(u);
break;
}
return ret;
}
int find_next_station(int s, int t, VI c) {
if (c.size() == 1) return c[0];
if (t > s) return c[1];
return c[0];
}
