#include "split.h"
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mxn = 2e5 + 5;
vi adj[mxn]; vi ans; int cur = 0;
int a1, b1, c1;
void dfs(int node, int prev, int i) {
ans[node] = i;
cur++;
//cout << node << " " << i << " " << cur << '\n';
if (i == 1) {if (cur == a1) {i++; cur = 0;}}
else if (i == 2) {if (cur == b1) {i++; cur = 0;}}
for (auto neighbour : adj[node]) {
if (neighbour == prev) continue;
dfs(neighbour, node, i);
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
a1 = a; b1 = b; c1 = c;
int m = p.size();
ans.resize(n);
for (int i = 0; i < m; i++) {
adj[p[i]].push_back(q[i]);
adj[q[i]].push_back(p[i]);
}
dfs(0, -1, 1);
return ans;
}
