#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define forn(i, n) for(int i = 0; i < n; ++i)
#define sz(a) (int)a.size()
#define pb push_back
#define all(a) a.begin(), a.end()
const int N = 3e5 + 10;
int p[N];
int get(int a) {return p[a] = (a == p[a] ? a : get(p[a]));}
void merge(int a, int b) {
a = get(a), b = get(b);
p[a] = b;
}
vector<pair<int, int>> adj[N];
int cnt[N], s;
set<int> require[N];
set<int> already, vis;
int mn = INT_MAX;
vector<int> component;
bool paiu;
void dfs(int u, vector<int>& r) {
component.pb(u);
vis.insert(u);
++cnt[s];
if(get(u) != get(s) && !paiu) {
merge(s, u);
return;
}
if(!already.count(r[u])) {
for(auto x: require[r[u]]) {
if(!vis.count(x)) {
dfs(x, r);
}
}
require[r[u]].clear();
}
already.insert(r[u]);
for(auto x: adj[u]) {
int v = x.first, c = x.second;
if(!vis.count(v)) {
if(already.count(c)) {
dfs(v, r);
} else {
require[c].insert(v);
}
}
}
}
void solve(int start, vector<int>& r) {
component.clear();
already.clear();
vis.clear();
s = start;
forn(i, sz(r)) require[i].clear();
dfs(start, r);
}
bool solved[N];
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
for(int i = 0; i < sz(u); ++i) {
adj[u[i]].pb({v[i], c[i]});
adj[v[i]].pb({u[i], c[i]});
}
forn(i, N) p[i] = i;
int n = sz(r);
vector<int> ans(n, 0);
for(int iter = 0; iter < 30; ++iter) {
for(int i = 0; i < n; ++i) {
if(get(i) == i) {
component.clear();
solve(i, r);
}
}
}
forn(i, N) cnt[i] = 0;
paiu = true;
for(int i = 0; i < n; ++i) {
if(!solved[i] && get(i) == i) {
solve(i, r);
for(auto x: component) {
solved[x] = true;
cnt[x] = cnt[i];
}
mn = min(mn, cnt[i]);
}
}
for(int i = 0; i < n; ++i) {
if(solved[i] && cnt[i] == mn) ans[i] = 1;
}
return ans;
}
