#include <fstream>

using namespace std;

const int NMAX = 1000001;

int N, M,
    T[NMAX],   /// Vector de tati (paduri de multimi disjuncte)
    Sz[NMAX];  /// Sz[i] = cate "noduri" are componenta de radacina i

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int Find(int x) /// Cautare cu compresie a drumului
{
    if (T[x] == 0)
        return x;
    return T[x] = Find(T[x]);
}

void Union(int rx, int ry) /// Union by size
{
    if (Sz[rx] < Sz[ry])
    {
        T[rx] = ry;
        Sz[ry] += Sz[rx];
    }
    else
    {
        T[ry] = rx;
        Sz[rx] += Sz[ry];
    }
}

int main()
{
    int cod, x, y, rx, ry;

    f >> N >> M;

    for (int i = 1; i <= N; i++)
        Sz[i] = 1;

    while (M--)
    {
        f >> cod >> x >> y;

        rx = Find(x);
        ry = Find(y);

        if (cod == 1)
        {
            /// if (rx != ry)  /// se garanteaza ca x si y nu se vor afla in aceeasi multime
            Union(rx, ry);
        }
        else
        {
            if (rx == ry)
                g << "DA\n";
            else
                g << "NU\n";
        }
    }

    return 0;
}