#include "split.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
vector<pair<int,int>> vec={{a,0},{b,1},{c,2}};
sort(all(vec));
vector<vector<int>> adj(n);
int m=(int)p.size();
for(int i=0;i<m;i++){
adj[p[i]].push_back(q[i]);
adj[q[i]].push_back(p[i]);
}
vector<int> sz(n);
vector<int> par(n);
function<void(int,int)> dfs=[&](int v,int p){
sz[v]=1;
par[v]=p;
for(auto u:adj[v]){
if(u==p) continue;
dfs(u,v);
sz[v]+=sz[u];
}
};
dfs(0,-1);
int x=-1;
vector<int> C(n);
for(int i=0;i<n;i++){
if(min(sz[i],n-sz[i])>=vec[0].f and max(sz[i],n-sz[i])>=vec[1].f){
x=i;
}
}
if(x==-1) return C;
C=vector<int>(n,vec[2].s);
function<void(int,int,int)> dfs2=[&](int v,int p,int CC){
C[v]=CC;
for(auto u:adj[v]){
if(u==p) continue;
dfs2(u,v,CC);
}
};
dfs2(x,par[x],(sz[x]<=n-sz[x]?vec[0].s:vec[1].s));
dfs2(par[x],x,(sz[x]<=n-sz[x]?vec[1].s:vec[0].s));
return C;
}
