SOLVE
LATER
Matt loves Graph Theory. He recently enrolled into the Algorithms course and started liking it too. His teacher understood his love for graphs and decided to give him a problem.
She gives him a Tree and asks him to write a program to find if it's connected or not. She realizes that Matt would do this in no time. So, instead she gives him a Graph and then removes a vertex from it and now asks him to find if the resultant graph is connected or not.
Since he is new to programming and algorithms, you have to help him solve this problem.
First line contains a single integer N denoting the number of vertices in the graph. Second line contains a single integer k denoting the number of edges in the graph. k lines follow each containing two space separated integers a and b denoting the edge between the vertices a and b. Then, the last line contains a single integer x which denotes the vertex that is removed from the graph.
"Connected" (without quotes) if the resultant graph is connected. "Not Connected" (without quotes), otherwise.
1 ≤ N ≤ 10^{5}
1 ≤ k ≤ 2×10^{5}
0 ≤ a,b ≤ 10^{5}
0 ≤ x ≤ 10^{5}
Number of vertices: 4
Number of edges: 3
It is still Connected.