#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
//#define int long long
vector<int> Alice(int n,int m,vector<int> u,vector<int> v,vector<int> c){
	vector<int> ans(0);
	static int deg[200010];
	for(int i=0;i<m;i++)deg[u[i]]++,deg[v[i]]++;
	for(int i=0;i<n;i++){
		if(deg[i]<8)continue;
		int o=min(c[i],7-c[i]);
		ans.pb(o&1);ans.pb(o>>1);}return ans;
}

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
//#define int long long
vector<int> g[200010];
int ans[200010],vis[200010];
void dfs(int u){
	vis[u]=1;
	for(auto v:g[u]){
		if(ans[v]!=-1&&!vis[v]
		&&min(ans[v],7-ans[v])==min(ans[u],7-ans[u])){
			ans[v]=7-ans[u];dfs(v);
		}
	}
}
vector<int> Bob(int n,int m,vector<int> u,vector<int> v,vector<int> x){
	for(int i=0;i<m;i++)g[u[i]].pb(v[i]),g[v[i]].pb(u[i]);
	for(int i=0,tot=0;i<n;i++){
		ans[i]=-1;
		if(g[i].size()<8)continue;
		ans[i]=x[tot++];ans[i]|=x[tot++]<<1;
	}
	for(int i=0;i<n;i++)
		if(!vis[i]&&~ans[i])dfs(i);
	for(int i=0;i<n;i++){
		if(ans[i]==-1){
			int buc[8]={0,0,0,0,0,0,0,0};
			for(auto v:g[i])
				if(~ans[v])buc[ans[v]]=1;
			for(int x=0;x<8;x++)if(!buc[x])ans[i]=x;
		}
	}
	return vector<int>(ans+1,ans+n+1);
}