#include <fstream>
#define N 100002

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");

int tata[N],rang[N];

void unite(int x,int y)
{
    if(rang[x]<rang[y])
        tata[x]=y;
    else
        tata[y]=x;
    if(rang[x]==rang[y])
        ++rang[x];
}
int root(int x)
{
    while(x!=tata[x]) x=tata[x];
    return x;
}
int main()
{
    int n,m,caz,x,y,rx,ry;
    f>>n>>m;
    for(int i=1;i<=n;++i) tata[i]=i;
    while(m--)
    {

        f>>caz>>x>>y;
        rx=root(x);
        ry=root(y);
        if(caz==1)
            unite(rx,ry);
        else
        {
            if(rx!=ry)
                g<<"NU\n";
            else
                g<<"DA\n";
        }

    }
    f.close();
    g.close();
    return 0;
}