#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int Nmax=100005;
int p[Nmax],s[Nmax];
int sef(int x)
{
    if(p[x]==x)
    {
        return x;
    }
    p[x]=sef(p[x]);
    return p[x];
}
int main()
{
    int n,m,t,x,y;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        p[i]=i;
    }
    for(int i=1;i<=m;i++)
    {
        fin>>t>>x>>y;
        if(t==1)
        {
            int s1=sef(x);
            int s2=sef(y);
            if(s1!=s2)
            {
                if(s[s1]>s[s2])
                {
                    swap(s1,s2);
                }
                p[s1]=s2;
                s[s2]=max(s[s1]+1,s[s2]);
            }
        }
        else
        {
            if(sef(x)==sef(y))
            {
                fout<<"DA"<<'\n';
            }
            else fout<<"NU"<<'\n';
        }
    }
    return 0;
}