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



        r = a

        while self.parent_or_size[r] >= 0:

            r = self.parent_or_size[r]



        while self.parent_or_size[a] >= 0:

            self.parent_or_size[a], a = r, self.parent_or_size[a]



        return r



    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))))

class UnionFind:

    __slots__ = ["N", "root"]



    def __init__(self, N):

        """

        N:要素数

        root:各要素の親要素の番号を格納するリスト.

             ただし, root[x] < 0 ならその頂点が根で-root[x]が木の要素数.

        """

        self.N = N

        self.root = [-1] * N



    def __repr__(self):

        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())



    def find(self, x):

        """頂点xの根を見つける"""

        r = x

        while self.root[r] >= 0:

            r = self.root[r]



        while self.root[x] >= 0:

            self.root[x], x = r, self.root[x]



        return r



    def union(self, x, y):

        """x, yが属する木をunion"""

        x = self.find(x)

        y = self.find(y)

        if x == y:

            return

        elif self.root[y] < self.root[x]:

            x, y = y, x

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

        self.root[y] = x



    def same(self, x, y):

        """xとyが同じグループに属するかどうか"""

        return self.find(x) == self.find(y)



    def count(self, x):

        """頂点xが属する木のサイズを返す"""

        return - self.root[self.find(x)]



    def members(self, x):

        """xが属する木の要素を列挙"""

        _root = self.find(x)

        return [i for i in range(self.N) if self.find(i) == _root]



    def roots(self):

        """森の根を列挙"""

        return [i for i, x in enumerate(self.root) if x < 0]



    def group_count(self):

        """連結成分の数"""

        return len(self.roots())



    def all_group_members(self):

        """{ルート要素: [そのグループに含まれる要素のリスト], ...}の辞書を返す"""

        return {r: self.members(r) for r in self.roots()}





import sys

input = sys.stdin.readline

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

uf = UnionFind(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.union(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
        r = a
        while self.parent_or_size[r] >= 0:
            r = self.parent_or_size[r]
        while self.parent_or_size[a] >= 0:
            self.parent_or_size[a], a = r, self.parent_or_size[a]
        return r

    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))))

class UnionFind:
    __slots__ = ["N", "root"]

    def __init__(self, N):
        """
        N:要素数
        root:各要素の親要素の番号を格納するリスト.
             ただし, root[x] < 0 ならその頂点が根で-root[x]が木の要素数.
        """
        self.N = N
        self.root = [-1] * N

    def __repr__(self):
        return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())

    def find(self, x):
        """頂点xの根を見つける"""
        r = x
        while self.root[r] >= 0:
            r = self.root[r]
        while self.root[x] >= 0:
            self.root[x], x = r, self.root[x]
        return r

    def union(self, x, y):
        """x, yが属する木をunion"""
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        elif self.root[y] < self.root[x]:
            x, y = y, x
        self.root[x] += self.root[y]
        self.root[y] = x

    def same(self, x, y):
        """xとyが同じグループに属するかどうか"""
        return self.find(x) == self.find(y)

    def count(self, x):
        """頂点xが属する木のサイズを返す"""
        return -self.root[self.find(x)]

    def members(self, x):
        """xが属する木の要素を列挙"""
        _root = self.find(x)
        return [i for i in range(self.N) if self.find(i) == _root]

    def roots(self):
        """森の根を列挙"""
        return [i for i, x in enumerate(self.root) if x < 0]

    def group_count(self):
        """連結成分の数"""
        return len(self.roots())

    def all_group_members(self):
        """{ルート要素: [そのグループに含まれる要素のリスト], ...}の辞書を返す"""
        return {r: self.members(r) for r in self.roots()}


import sys

input = sys.stdin.readline
n, q = list(map(int, input().split()))
uf = UnionFind(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.union(u, v)
print(("\n".join(map(str, res))))

-import typing +class UnionFind: +    __slots__ = ["N", "root"] +    def __init__(self, N): +        """ +        N:要素数 +        root:各要素の親要素の番号を格納するリスト. +             ただし, root[x] < 0 ならその頂点が根で-root[x]が木の要素数. +        """ +        self.N = N +        self.root = [-1] * N -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 __repr__(self): +        return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots()) -    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 -        r = a -        while self.parent_or_size[r] >= 0: -            r = self.parent_or_size[r] -        while self.parent_or_size[a] >= 0: -            self.parent_or_size[a], a = r, self.parent_or_size[a] +    def find(self, x): +        """頂点xの根を見つける""" +        r = x +        while self.root[r] >= 0: +            r = self.root[r] +        while self.root[x] >= 0: +            self.root[x], x = r, self.root[x] -    def size(self, a: int) -> int: -        assert 0 <= a < self._n -        return -self.parent_or_size[self.leader(a)] +    def union(self, x, y): +        """x, yが属する木をunion""" +        x = self.find(x) +        y = self.find(y) +        if x == y: +            return +        elif self.root[y] < self.root[x]: +            x, y = y, x +        self.root[x] += self.root[y] +        self.root[y] = x -    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]) +    def same(self, x, y): +        """xとyが同じグループに属するかどうか""" +        return self.find(x) == self.find(y) + +    def count(self, x): +        """頂点xが属する木のサイズを返す""" +        return -self.root[self.find(x)] + +    def members(self, x): +        """xが属する木の要素を列挙""" +        _root = self.find(x) +        return [i for i in range(self.N) if self.find(i) == _root] + +    def roots(self): +        """森の根を列挙""" +        return [i for i, x in enumerate(self.root) if x < 0] + +    def group_count(self): +        """連結成分の数""" +        return len(self.roots()) + +    def all_group_members(self): +        """{ルート要素: [そのグループに含まれる要素のリスト], ...}の辞書を返す""" +        return {r: self.members(r) for r in self.roots()} -uf = DSU(n) +uf = UnionFind(n) -        uf.merge(u, v) +        uf.union(u, v)