#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[100010], nrelem[100010], n, m;

int cautare_rad(int nod)
{
    if(t[nod]==nod)
        return nod;
    else
        return cautare_rad(t[nod]);
}

void actualizare(int nod, int rad)
{
    int aux;
    while(t[nod] != rad)
    {
        aux = t[nod];
        t[nod] = rad;
        nod = aux;
    }
}

int main()
{
    int i, p, x, y, rx, ry;
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        t[i] = i;
        nrelem[i] = 1;
    }
    for(i=1; i<=m; i++)
    {
        fin>>p>>x>>y;
        if(p==1)
        {
            rx = cautare_rad(x);
            ry = cautare_rad(y);
            if(nrelem[rx] < nrelem[ry])
            {
                t[rx] = ry;
                nrelem[ry] += nrelem[rx];
            }
            else
            {
                t[ry] = rx;
                nrelem[rx] += nrelem[ry];
            }
        }
        else
        {
            rx = cautare_rad(x);
            ry = cautare_rad(y);
            if(rx == ry)
                fout<<"DA"<<'\n';
            else
                fout<<"NU"<<'\n';
            actualizare(x, rx);
            actualizare(y, ry);
        }
    }

    fin.close();
    fout.close();
    return 0;
}