#include <fstream>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");
int t[100005],rang[100005],n,m;

int rad(int x)
{
    int urm,root=x;
    while(t[root]!=root)
        root=t[root];

    while(t[x]!=x)
    {
        urm=t[x];
        t[x]=root;
        x=urm;
    }

    return root;
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        {
            t[i]=i;
            rang[i]=1;
        }
    while(m--)
    {
        int cod,x,y;
        f>>cod>>x>>y;
        if(cod==1)
        {
            if(rad(x)!=rad(y))
                {
                t[y]=x;
                rang[x]+=y;
                }
        }
        else
        {
            if(rad(x)!=rad(y))
                g<<"NU"<<'\n';
            else  g<<"DA"<<'\n';
        }
    }
    return 0;
}