Nasty Queries

Hussain was doing research on graph theory, and he came up with a new family of graphs called Deadwing Graphs. Consider an undirected graph. We can partition the vertices uniquely into connected components, such that two vertices belong to the same connected component if and only if they are connected by a sequence of edges. We call a graph Good, if for every vertex, there is a walk starting fro