#include<iostream>
#include<fstream>
using namespace std;
const int NMAX=100001;

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

int t[NMAX];

int Find(int i)
{
    if(t[i]==0) return i;
    return t[i]=Find(t[i]);
}

inline void Union(int cx, int cy)
{
    t[cy]=cx;
}

int main()
{
    int n,m,op,x,y,cx,cy;
    fin>>n>>m;
    while(m--)
    {
        fin>>op>>x>>y;
        cx=Find(x);
        cy=Find(y);
        if(op==1)
        {
            if(cx!=cy) Union(cx,cy);
        }
        else
        {
            if(cx==cy) fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }

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