#include <bits/stdc++.h>
#include "stations.h"
using namespace std;
vector<int> a;
vector<vector<int>> g;
void dfs(int u, int p) {
a.push_back(u);
for (auto v : g[u]) {
if (v != p) {
dfs(v, u);
}
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
g.assign(n, {});
for (int i = 0; i < n - 1; i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
for (int i = 0; i < n; i++) {
if (g[i].size() == 1) {
dfs(i, -1);
break;
}
}
assert(a.size() == n);
vector<int> labels(n);
for (int i = 0; i < n; i++) {
labels[i] = a[i];
// labels[a[i]] = i;
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if (s < t) {
return c.back();
} else {
return c[0];
}
}
