#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m;
int v[100010],rang[100010];
int cauta_rad(int x)
{
    int r=x,y;
    while(v[r]!=r) r=v[r];
    while(v[x]!=x)
    {
        y=v[x];
        v[x]=r;
        x=y;
    }
    return r;
}
void unire(int x, int y)
{
    if(rang[x]>rang[y])
        v[y]=x;
    else v[x]=y;
    if(rang[x]==rang[y]) rang[y]++;
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        v[i]=i;
        rang[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        int op,x1,x2;
        f>>op>>x1>>x2;
        if(op==1)
        {
            if(cauta_rad(x1)!=cauta_rad(x2))
                unire(x1,x2);
        }
        else
        {
            if(cauta_rad(x1)==cauta_rad(x2)) g<<"DA"<<"\n";
            else g<<"NU"<<"\n";
        }
    }
    return 0;
}