#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");ofstream fout("disjoint.out");
int t[100005],n,m,cer,x,y;
int reun(int var)
{
    if(t[var]!=var)
    {
        t[var]=reun(t[var]);
    }
    return t[var];
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        t[i]=i;
    while(m)
    {
        fin>>cer>>x>>y;
        if(cer==1)
        {
            x=reun(x);
            y=reun(y);
            t[x]=t[y];
        }else
        {
            x=reun(x);
            y=reun(y);
            if(x==y)
                fout<<"DA"<<'\n';
            else
                fout<<"NU"<<'\n';
        }
        m-=1;
    }
}