Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Connected Components

Write a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.

Input

In the first line, two integer $n$ and $m$ are given. $n$ is the number of users in the SNS and $m$ is the number of relations in the SNS. The users in the SNS are identified by IDs $0, 1, ..., n-1$.

In the following $m$ lines, the relations are given. Each relation is given by two integers $s$ and $t$ that represents $s$ and $t$ are friends (and reachable each other).

In the next line, the number of queries $q$ is given. In the following $q$ lines, $q$ queries are given respectively. Each query consists of two integers $s$ and $t$ separated by a space character.

Output

For each query, print "yes" if $t$ is reachable from $s$ through the social network, "no" otherwise.

Constraints

$2 \leq n \leq 100,000$

$0 \leq m \leq 100,000$

$1 \leq q \leq 10,000$

Sample Input

10 9
0 1
0 2
3 4
5 7
5 6
6 7
6 8
7 8
8 9
3
0 1
5 9
1 3

Sample Output

yes
yes
no

Solution in JAVA (judge verdict: Accepted)

import java.util.Scanner;

public class Main {

	static int[] par, rank;
	
	static void init(int N) {//初期化
		for(int i=0; i<N; i++) {
			rank[i]=0;
			par[i]=i;
		}
	}

	static int root(int x) {//親を求める
		//System.out.println("para="+par[x]);
		if(par[x]==x) {
			return x;
		}
		return par[x]=root(par[x]);
	}

	static boolean same(int x, int y) {//判定(同グループかどうか)
		return (root(x)==root(y));
	}

	static void unite(int x, int y) {//まとめる
		x = root(x);
	    y = root(y);
	 
	    if(x == y)return;
	 
	    if(rank[x] < rank[y]){
	        par[x] = y;
	    }else{
	        par[y] = x;
	        if(rank[x] == rank[y])rank[x]++;
	    }
	}


	public static void main(String[] args) {
		try(Scanner sc = new Scanner(System.in)){
				int n=sc.nextInt();
				int m=sc.nextInt();
				rank=new int[n+1];
				par=new int[n+1];
				init(n);
				for(int i=0; i<m; i++) {
					int a=sc.nextInt();
					int b=sc.nextInt();
					unite(a, b);
				}
				int q=sc.nextInt();
				//System.out.println("q="+q);
				for(int i=0; i<q; i++) {
					int a=sc.nextInt();
					int b=sc.nextInt();
					//System.out.println("a="+a+" b="+b);
					if(same(a, b)) {
						System.out.println("yes");
					}
					else {
						System.out.println("no");
					}
				}

		}
	}
}