#include <cstdio>

const int N = 2e4, M = 1e5;
int n, m;

int fa[N+5];

int find(int x)
{
    if (fa[x] != x) fa[x] = find(fa[x]);
    return fa[x];
}

int main(void)
{
	freopen("relation.in", "r", stdin);
	freopen("relation.out", "w", stdout);
	
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) fa[i] = i;
	for (; m; m--) {
		int op, x, y;
		scanf("%d %d %d", &op, &x, &y);
		int a = find(x), b = find(y);
		if (op == 0 && a != b) fa[a] = b;
		if (op == 1) {
		   if (a == b) puts("Yes");
		   else puts("No");
		}
	}
	
	fclose(stdin);
	fclose(stdout);
	
    return 0;
}