#include <bits/stdc++.h>
using namespace std;
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
int n = r.size(), m = u.size();
vector<vector<pair<int, int>>> edge(n);
for (int i = 0; i < m; i++) {
edge[u[i]].emplace_back(v[i], c[i]);
edge[v[i]].emplace_back(u[i], c[i]);
}
vector<int> p(n);
for (int i = 0; i < n; i++) {
queue<int> bfs;
vector<vector<int>> pending(n);
vector<int> colored(n), vis(n);
bfs.push(i);
while (!bfs.empty()) {
int u = bfs.front();
bfs.pop();
if (vis[u]) continue;
vis[u] = true;
if (!colored[r[u]]) {
colored[r[u]] = true;
for (int v : pending[r[u]]) bfs.push(v);
pending[r[u]].clear();
}
for (auto [v, c] : edge[u]) {
if (colored[c]) bfs.push(v);
else pending[c].push_back(v);
}
}
p[i] = accumulate(vis.begin(), vis.end(), 0);
}
int min_p = *min_element(p.begin(), p.end());
vector<int> ret(n);
for (int i = 0; i < n; i++) ret[i] = (p[i] == min_p);
return ret;
}
