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 JavaScript (judge verdict: Accepted)

(function(stdin) {
  var lines = stdin.trim().split('\n');
  var numbers = lines.shift().split(' ').map(Number);
  var n = numbers.shift();
  var m = numbers.shift();
  var nodes = [];
  var color = [];
  for (var i = 0; i < n; i++) {
    nodes.push([]);
    color.push(null);
  }
  for (var i = 0; i < m; i++) {
    var node = lines.shift().split(' ').map(Number);
    nodes[node[0]].push(node[1]);
    nodes[node[1]].push(node[0]);
  }
  function dfs(n, id) {
    var stack = [];
    color[n] = id;
    stack.push(n);
    while (stack.length > 0) {
      var next = stack.shift();
      for (var i = 0; i < nodes[next].length; i++) {
        if (!color[nodes[next][i]]) {
          color[nodes[next][i]] = id;
          stack.push(nodes[next][i]);
        }
      }
    }
  }
  var id = 1;
  for (var i = 0; i < n; i++) {
    if (!color[i]) {
      dfs(i, id++);
    }
  }
  var q = parseInt(lines.shift(), 10);
  lines.forEach(function(relation) {
    var edge = relation.split(' ').map(Number);
    if (color[edge[0]] == color[edge[1]]) {
      console.log('yes');
    } else {
      console.log('no');
    }
  });
})(require('fs').readFileSync('/dev/stdin', 'utf8'));