import typing





class DSU:

    '''

    Implement (union by size) + (path compression)

    Reference:

    Zvi Galil and Giuseppe F. Italiano,

    Data structures and algorithms for disjoint set union problems

    '''



    def __init__(self, n: int = 0):

        self._n = n

        self.parent_or_size = [-1] * n



    def merge(self, a: int, b: int) -> int:

        assert 0 <= a < self._n

        assert 0 <= b < self._n



        x = self.leader(a)

        y = self.leader(b)



        if x == y:

            return x



        if -self.parent_or_size[x] < -self.parent_or_size[y]:

            x, y = y, x



        self.parent_or_size[x] += self.parent_or_size[y]

        self.parent_or_size[y] = x



        return x



    def same(self, a: int, b: int) -> bool:

        assert 0 <= a < self._n

        assert 0 <= b < self._n



        return self.leader(a) == self.leader(b)



    def leader(self, a: int) -> int:

        assert 0 <= a < self._n



        if self.parent_or_size[a] < 0:

            return a



        self.parent_or_size[a] = self.leader(self.parent_or_size[a])

        return self.parent_or_size[a]



    def size(self, a: int) -> int:

        assert 0 <= a < self._n



        return -self.parent_or_size[self.leader(a)]



    def groups(self) -> typing.List[typing.List[int]]:

        leader_buf = [self.leader(i) for i in range(self._n)]



        result = [[] for _ in range(self._n)]

        for i in range(self._n):

            result[leader_buf[i]].append(i)



        return list([r for r in result if r])





import sys

input = sys.stdin.readline

n, q = list(map(int, input().split()))

uf = DSU(n)

res = []

for i in range(q):

    t, u, v = list(map(int, input().split()))

    if t:

        res.append(int(uf.same(u, v)))

    else:

        uf.merge(u, v)

print(("\n".join(map(str, res))))

import typing





class DSU:

    '''

    Implement (union by size) + (path compression)

    Reference:

    Zvi Galil and Giuseppe F. Italiano,

    Data structures and algorithms for disjoint set union problems

    '''



    def __init__(self, n: int = 0):

        self._n = n

        self.parent_or_size = [-1] * n



    def merge(self, a: int, b: int) -> int:

        assert 0 <= a < self._n

        assert 0 <= b < self._n



        x = self.leader(a)

        y = self.leader(b)



        if x == y:

            return x



        if -self.parent_or_size[x] < -self.parent_or_size[y]:

            x, y = y, x



        self.parent_or_size[x] += self.parent_or_size[y]

        self.parent_or_size[y] = x



        return x



    def same(self, a: int, b: int) -> bool:

        assert 0 <= a < self._n

        assert 0 <= b < self._n



        return self.leader(a) == self.leader(b)



    def leader(self, a: int) -> int:

        assert 0 <= a < self._n



        update_list = []

        while self.parent_or_size[a] >= 0:

            update_list.append(a)

            a = self.parent_or_size[a]



        for i in update_list:

            self.parent_or_size[i] = a



        return a



    def size(self, a: int) -> int:

        assert 0 <= a < self._n



        return -self.parent_or_size[self.leader(a)]



    def groups(self) -> typing.List[typing.List[int]]:

        leader_buf = [self.leader(i) for i in range(self._n)]



        result = [[] for _ in range(self._n)]

        for i in range(self._n):

            result[leader_buf[i]].append(i)



        return list([r for r in result if r])





import sys

input = sys.stdin.readline

n, q = list(map(int, input().split()))

uf = DSU(n)

res = []

for i in range(q):

    t, u, v = list(map(int, input().split()))

    if t:

        res.append(int(uf.same(u, v)))

    else:

        uf.merge(u, v)

print(("\n".join(map(str, res))))

import typing


class DSU:
    """
    Implement (union by size) + (path compression)
    Reference:
    Zvi Galil and Giuseppe F. Italiano,
    Data structures and algorithms for disjoint set union problems
    """

    def __init__(self, n: int = 0):
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a: int, b: int) -> int:
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        x = self.leader(a)
        y = self.leader(b)
        if x == y:
            return x
        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x
        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x
        return x

    def same(self, a: int, b: int) -> bool:
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        return self.leader(a) == self.leader(b)

    def leader(self, a: int) -> int:
        assert 0 <= a < self._n
        if self.parent_or_size[a] < 0:
            return a
        self.parent_or_size[a] = self.leader(self.parent_or_size[a])
        return self.parent_or_size[a]

    def size(self, a: int) -> int:
        assert 0 <= a < self._n
        return -self.parent_or_size[self.leader(a)]

    def groups(self) -> typing.List[typing.List[int]]:
        leader_buf = [self.leader(i) for i in range(self._n)]
        result = [[] for _ in range(self._n)]
        for i in range(self._n):
            result[leader_buf[i]].append(i)
        return list([r for r in result if r])


import sys

input = sys.stdin.readline
n, q = list(map(int, input().split()))
uf = DSU(n)
res = []
for i in range(q):
    t, u, v = list(map(int, input().split()))
    if t:
        res.append(int(uf.same(u, v)))
    else:
        uf.merge(u, v)
print(("\n".join(map(str, res))))

import typing


class DSU:
    """
    Implement (union by size) + (path compression)
    Reference:
    Zvi Galil and Giuseppe F. Italiano,
    Data structures and algorithms for disjoint set union problems
    """

    def __init__(self, n: int = 0):
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a: int, b: int) -> int:
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        x = self.leader(a)
        y = self.leader(b)
        if x == y:
            return x
        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x
        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x
        return x

    def same(self, a: int, b: int) -> bool:
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        return self.leader(a) == self.leader(b)

    def leader(self, a: int) -> int:
        assert 0 <= a < self._n
        update_list = []
        while self.parent_or_size[a] >= 0:
            update_list.append(a)
            a = self.parent_or_size[a]
        for i in update_list:
            self.parent_or_size[i] = a
        return a

    def size(self, a: int) -> int:
        assert 0 <= a < self._n
        return -self.parent_or_size[self.leader(a)]

    def groups(self) -> typing.List[typing.List[int]]:
        leader_buf = [self.leader(i) for i in range(self._n)]
        result = [[] for _ in range(self._n)]
        for i in range(self._n):
            result[leader_buf[i]].append(i)
        return list([r for r in result if r])


import sys

input = sys.stdin.readline
n, q = list(map(int, input().split()))
uf = DSU(n)
res = []
for i in range(q):
    t, u, v = list(map(int, input().split()))
    if t:
        res.append(int(uf.same(u, v)))
    else:
        uf.merge(u, v)
print(("\n".join(map(str, res))))

-        if self.parent_or_size[a] < 0: -            return a -        self.parent_or_size[a] = self.leader(self.parent_or_size[a]) -        return self.parent_or_size[a] +        update_list = [] +        while self.parent_or_size[a] >= 0: +            update_list.append(a) +            a = self.parent_or_size[a] +        for i in update_list: +            self.parent_or_size[i] = a +        return a