#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define pb push_back
const int nax=200005;
vector<int> adj[nax];
int fst;
int parent;
vector<int> res;
int aa,bb;
void dfs(int x,int p,int cur){
if(cur==aa){
//cout <<x<<endl;
fst=x;
parent=p;
return;
}
res[x]=1;
for(auto u:adj[x]){
if(u==p) continue;
dfs(u,x,cur+1);
}
}
void dfs1(int x,int p,int cur){
if(cur==bb) return;
//cout <<x<<endl;
res[x]=2;
for(auto u:adj[x]){
if(u==p) continue;
dfs1(u,x,cur+1);
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q){
bb=b;
res.resize(n,0);
bool test=false;
if(a>0) aa=a;
else if(b>0){
test=true;
aa=b;
bb=a;
}else{
for (int i = 0; i < n; ++i)
{
res[i]=3;
}
return res;
}
for (int i = 0; i < (int)p.size(); ++i)
{
adj[p[i]].pb(q[i]);
adj[q[i]].pb(p[i]);
}
for (int i = 0; i < n; ++i)
{
if(adj[i].size()==1) fst=i;
}
//cout <<fst<<endl;
dfs(fst,-1,0);
//cout <<fst<<endl;
dfs1(fst,parent,0);
for (int i = 0; i < n; ++i)
{
if(res[i]==0) res[i]=3;
else if(test){
if(res[i]==1) res[i]=2;
else res[i]=1;
}
//cout <<res[i]<<" ";
}//cout <<endl;
return res;
}
