#include"bits/stdc++.h"
// #define int long long
#define endl '\n'
using namespace std;
vector<pair<int,int>> adj[200001];
stack<int> keys[30];
vector<int> find_reachable (vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
int n = r.size(), m = u.size();
for (int i = 0 ; i < m ; i++) {
adj[u[i]].emplace_back(v[i], c[i]);
adj[v[i]].emplace_back(u[i], c[i]);
}
int p[n];
for (int i = 0 ; i < n ; i++) {
for (auto& j : keys) while (j.size()) j.pop();
bitset<200001> vis(0);
bitset<200001> got(0);
vector<bitset<200001>> viz(30, bitset<200001>(0));
queue<int> process;
process.push(i);
vis[i] = 1;
while (process.size()) {
auto cur = process.front();
// cerr << cur << endl;
process.pop();
got[r[cur]] = 1;
while (keys[r[cur]].size()) {
if (!vis[keys[r[cur]].top()]) {
process.push(keys[r[cur]].top());
vis[keys[r[cur]].top()] = 1;
}
keys[r[cur]].pop();
}
for (auto i : adj[cur]) {
if (got[i.second]) {
if (!vis[i.first]) {
process.push(i.first);
vis[i.first] = 1;
}
}
else if (!vis[i.first] and !viz[i.second][i.first]){
keys[i.second].push(i.first);
viz[i.second][i.first] = 1;
}
}
}
p[i] = vis.count();
// cerr << p[i] << " ";
}
// cerr << endl;
int x = *min_element(p, p + n);
vector<int> ret(n);
for (int i = 0 ; i < n ; i++) if (p[i] == x) ret[i] = 1;
return ret;
}
