3887. Incremental Even-Weighted Cycle Queries

You are given a positive integer n. There is an undirected graph with n nodes labeled from 0 to n - 1. Initially, the graph has no edges. You are also given a 2D integer array edges, where edges[i] = [ui, vi, wi] represents an edge between nodes ui and vi with weight wi. The weight wi is either 0 or 1. Process the edges in edges in the given order. For each edge, add it to the graph only if, af