#include <iostream>
#include <vector>
using namespace std;

const int MAXN = 1000;

int p[MAXN+1]; // parent array for union-find

// initialize the parent array for union-find
void make_set(int n) {
    for (int i = 0; i <= n; i++) {
        p[i] = i;
    }
}

// find the parent of a set in union-find
int find_set(int x) {
    if (p[x] != x) {
        p[x] = find_set(p[x]);
    }
    return p[x];
}

// union two sets in union-find
void union_sets(int x, int y) {
    int px = find_set(x), py = find_set(y);
    if (px != py) {
        p[px] = py;
    }
}

int main() {
    int n;
    cin >> n;

    make_set(MAXN); // initialize the parent array

    while (n--) {
        int p, q;
        cin >> p >> q;

        if (find_set(p) != find_set(q)) {
            union_sets(p, q);
        }
    }

    int k;
    cin >> k;

    while (k--) {
        int p, q;
        cin >> p >> q;

        if (find_set(p) == find_set(q)) {
            cout << "Y" << endl;
        } else {
            cout << "N" << endl;
        }
    }

    return 0;
}