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

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <cmath>
#include <functional>
#include <fstream>
#include <cstdlib>
typedef long long ll;
const int MOD = 1e9+7;


#define REP(i, N) for (int i = 0; i < (N); i++)
#define REPP(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define VSORT(c) sort((c).begin(),(c).end())
#define SZ(x) ((int)(x).size())
//vvintを作る　マクロで　 #define vvint(N,M) vector<vector<int>>

using namespace std;
vector<int> group_id(100001);
vector<vector<int> > groups(100001);
int n;
void dfs(int i ,int c){
    stack<int> s;
    s.push(i);
    group_id[i] = c;
    while(!s.empty()){
        int u = s.top();s.pop();
        for(int l = 0; l < groups[u].size();l++){
            int g = groups[u][l];
            if(group_id[g] == -1){
                group_id[g] = c;
                s.push(g);
            }
        }
    }
}
void makeGroup(){
    int id = 0;
    for(int i = 0; i < n;i++) group_id[i] = -1;
    for(int i = 0; i < n;i++){
        if(group_id[i] == -1){
            dfs(i,id++);
        }
    }
}


int main(){
    
    cin.tie(0);
    ios::sync_with_stdio(false);
    int m;

    cin >> n >> m;

    int f,s;
    for(int i = 0; i < m;i++){
        cin >> f >> s;
        groups[f].push_back(s);
        groups[s].push_back(f);
    }

    makeGroup();

    int cnt;
    cin >> cnt;
    for(int i = 0; i < cnt;i++){
        cin >> f >> s;
        if(group_id[f] == group_id[s]){
            cout << "yes" << endl;
        }else{
            cout << "no" << endl;
        }
    }

    // for(int i = 0; i < n;i++){
    //     cout << i << " : " << group_id[i] << endl;
    // }


    return 0;
}