#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3+5;
vector<int> adj[MAXN];
vector<int> labels;
void dfs(int s, int p, int d){
labels[s] = d;
for(int viz : adj[s])
if(viz != p)dfs(viz,s,d+1);
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
labels.resize(n);
for (int i = 0; i < n-1; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
for (int i = 0; i < n; i++)
if(adj[i].size() == 1){dfs(i,-1,0); break;}
for(int i = 0; i < n; i++)adj[i].clear();
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if(c.size() == 1)return c[0];
if(s < t)return max(c[0],c[1]);
return min(c[0],c[1]);
}
