rt

#include <cstdio>
using namespace std;
int fa[1005], n, m, z, x, y;
int find(int x) {
	if (fa[x] == 0) return x;
	return fa[x] = find(fa[x]);
}
void merge(int x, int y) {
    int fx = find(x), fy = find(y);
    if (fx != fy) fa[fx] = fy;
}
int main() {
	scanf("%d%d", &n, &m);
	while (m--) {
		scanf("%d%d%d", &z, &x, &y);
		if (z == 1) {
			merge(x, y);
		} else {
			if (find(x) == find(y)) printf("Y");
			else printf("N");
			printf("\n");
		}
	}
	return 0;
}