#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define lim 1005
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
for(int i=0;i<n;i++){
labels[i]=i;
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
int node1=s,node2=t;
int son;
while(node1!=node2){
//cout<<node1<<" "<<node2<<endl;
if(node1>node2){
node1>>=1;
}
else{
son=node2;
node2>>=1;
}
}
if(node1==s){
return son;
}
else{
int cev=(s>>1);
return cev;
}
}
//~ int main(){
//~ int n,k;
//~ //cin>>n>>k;
//~ vector<int> u,v;
//~ for(int i=1;i<n;i++){
//~ int x,y;cin>>x>>y;
//~ u.pb(x);
//~ v.pb(y);
//~ }
//~ vector<int> tut=label(n,k,u,v);
//~ for(auto a:tut)cout<<a<<" ";
//~ cout<<'\n';
//~ int q;cin>>q;
//~ while(q--){
//~ int s,t;cin>>s>>t;
//~ int kac;cin>>kac;
//~ vector<int> tt;
//~ for(int i=0;i<kac;i++){
//~ int x;cin>>x;
//~ tt.pb(x);
//~ }
//~ cout<<find_next_station(s,t,tt)<<'\n';
//~ }
//~ }
