Priya and Parity

There are $N$ cities number from $1$ to $N$ each city is having a weight of $w_{i}$ and they are connected through $M$ bidirectional roads between them. Let the parity of a city $c_{i} $ be even if the number of set bits in its binary representation of $w_{i}$ is even and odd otherwise. You are given $Q$ queries, each query can be of two types: - $1$ $K$ - print the size of **largest** conne