#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[100010],N,M;
int cautare(int x)
{
    if(x==t[x])
    {
        return x;
    }
    else
    {
        t[x]=cautare(t[x]);
        return(t[x]);

    }
}
int main()
{
    int i,j,cer,x,y;
    fin>>N>>M;
    for(i=1;i<=N;i++)
        t[i]=i;
    for(i=1;i<=M;i++)
    {
        fin>>cer>>x>>y;
        if(cer==1)
        {
            x=cautare(x);
            y=cautare(y);
            t[x]=y;
        }
        else
        {
            if(cautare(x)==cautare(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
}