Too many graphs

Problem description. There are $N$ nodes in an undirected graph and $Q$ queries . Initially there are no edges in the graph. In each query you are given an edge connecting two nodes $x$ and $y$ . For each query you can either decide to add that edge in the graph or leave the graph as it is . So there will be many graphs possible . For each such graph can you find the number of nodes with even deg