#include <iostream>
#include <fstream>
using namespace std;
int rad[100010],h[100010];

int find(int x)
{
    if(x==rad[x])
        return x;
    else
        return find(rad[x]);
}

void Union(int x,int y)
{
    if(h[x]==h[y])
    {
        h[x]++;
        rad[x]=y;
    }
    else
        if(h[x]>h[y])
            rad[x]=y;
    else
        rad[y]=x;
}

int main()
{
    ifstream in("disjoint.in");
    ofstream out("disjoint.out");

    int i,n,m,x,y,tx,ty,cod;
    in>>n>>m;
    for(i=1;i<=n;i++)
        rad[i]=i;
    for(i=1;i<=m;i++)
    {
        in>>cod>>x>>y;
        if(cod==1)
        {
                tx=find(x);
                ty=find(y);
                Union(tx,ty);
            }
            else
            {
                tx=find(x);
                ty=find(y);
                if(tx!=ty)
                    out<<"NU"<<"\n";
                    else
                        out<<"DA"<<"\n";

                }

    }
    return 0;
}