Hello I have been trying to come up with an idea for the following graph theory problem :

Given an undirected graph of N vertices and E edges , You have to process a list of Q queries. In query q (1 <= q <= Q) , you remove some edge e , and you are to report the number of components in the new graph. Removal of each edge is permanent , i.e for query #q you should assume that ALL the given q edges have been removed.

N , E and Q can be at most 200,000 Thanks a lot!