#include "split.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()
int n,a,b,c;
vector<int>p,q;
vector<vector<int>>g;
vector<int> res;
vector<int>child;
void cfind(int start,int pre)
{
for(auto x:g[start])
if(x!=pre)
{
cfind(x,start);
child[start]+=child[x]+1;
}
}
vector<int> find_split(int nn, int aa, int bb, int cc, vector<int> pp, vector<int> qq) {
p=pp;
q=qq;
n=nn;
a=aa;
b=bb;
c=cc;
g.assign(n,vector<int>());
res.assign(n,0);
child.assign(n,0);
ll m=p.size();
for(int i=0;i<m;i++)
{
g[p[i]].pb(q[i]);
g[q[i]].pb(p[i]);
}
cfind(0,0);
pair<int,int>arr[3];
arr[0]={a,1};
arr[1]={b,2};
arr[2]={c,3};
sort(arr,arr+3);
for(int i=1;i<n;i++)
{
if(child[i]+1<arr[0].F || child[0]-child[i]<arr[1].F)
continue;
queue<int>q;
q.push(i);
ll count=1;
vector<bool>vis(n,0);
while(!q.empty())
{
ll curr=q.front();
q.pop();
vis[curr]=1;
res[curr]=arr[0].S;
for(auto x:g[curr])
if(!vis[x] && count<arr[0].F && child[x]<child[curr])
{
vis[x]=1;
q.push(x);
count++;
}
}
q.push(0);
count=1;
while(!q.empty())
{
ll curr=q.front();
q.pop();
vis[curr]=1;
res[curr]=arr[1].S;
for(auto x:g[curr])
if(!vis[x] && count<arr[1].F)
{
vis[x]=1;
q.push(x);
count++;
}
}
for(int i=0;i<n;i++)
if(!res[i])
res[i]=arr[2].S;
break;
}
return res;
}
