#include <fstream>
#include <stdbool.h>
#define N 100000

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int t[N+1], nr[N + 1], n;

int radacina(int x)
{
    if (t[x] == 0)
    {
        return x;
    }
    t[x] = radacina(t[x]);
    return t[x];
}

void reuniune(int x, int y)
{
    int rx = radacina(x);
    int ry = radacina(y);
    if (nr[rx] < nr[ry])
    {
        nr[ry] += nr[rx];
        t[rx] = ry;
    }
    else
    {
        nr[rx] += nr[ry];
        t[ry] = rx;
    }
}

bool verificare(int x, int y)
{
    return (radacina(x) == radacina(y));
}

int main()
{
    int m;
    fin>>n>>m;
    for (int i = 1; i <= n; i++)
    {
        nr[i] = 1;
    }
    for (int i = 0; i < m; i++)
    {
        int cod, x, y;
        fin>>cod>>x>>y;
        if (cod == 1)
        {
            reuniune(x, y);
        }
        else
        {
            if (verificare(x, y))
            {
                fout<<"DA\n";
            }
            else
            {
                fout<<"NU\n";
            }
        }
    }
    return 0;
}