#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10, INF = 0x3f3f3f3f, MOD = 1E9 + 7;
int n, m, p[N];

// 查询 u 的最远祖先
int find(int u) {
    return u == p[u] ? u : p[u] = find(p[u]);
}
// 合并 u-v
void merge(int u, int v) {
    int fu = find(u), fv = find(v);
    if (fu != fv)
        p[fu] = fv;
}
int main(int argc, char* argv[]) {
    cin >> n >> m;
    for (int i = 0; i <= n; i++)
        p[i] = i;  // 注意初始化
    int x, y, z;
    while (m--) {
        cin >> z >> x >> y;
        if (z == 1)
            merge(x, y);
        else
            cout << (find(x) == find(y) ? "Y" : "N") << endl;
    }
    return 0;
}