#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> ans(n); vector<vector<int>> adj(n); vector<int> deg(n);
queue<int> q;
for (int i = 0; i < n - 1; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
deg[u[i]]++; deg[v[i]]++;
}
for (int i = 0; i < n; i++) {
if (deg[i] == 1) {
q.push(i);
break;
}
}
int amt = 0; vector<int> done(n);
while (!q.empty()) {
int cur = q.front();
// cout << cur << " node\n";
q.pop();
ans[cur] = amt++;
done[cur] = 1;
for (auto &neighbour : adj[cur]) {
if (done[neighbour]) continue;
deg[neighbour]--;
if (deg[neighbour] <= 1) q.push(neighbour);
}
}
return ans;
}
int find_next_station(int s, int t, std::vector<int> c) {
if ((int)c.size() == 1) return c[0];
if (s < t) return c[1];
else return c[0];
}
