void dfs(vector<vector<int>> &adj, vector<bool> &visited, int u) {
	if (visited[u]) {
	return;
	}
	visited[u] = true;
	for (int i = 0; i < adj[u].size(); i++) {
		int v = adj[u][i];
		dfs(adj, visited, v);
	}
}