#include <iostream>
#include <fstream>

using namespace std;

#define MAX 100002

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

int dad[MAX];

int sef(int x)
{
    if(x!=dad[x])
        dad[x]=sef(dad[x]);
    return dad[x];
}

int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        dad[i]=i;
    while(m--)
    {
        int k,x,y;
        fin>>k>>x>>y;
        x=sef(x);
        y=sef(y);
        if(k==1)
        {
            dad[y]=dad[x];
        }
        if(k==2)
        {
            if(dad[x]==dad[y])
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}