#include <iostream>
#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int a[100004];
int Find(int x)
    {
        int root,x1=x;
        while(a[x1]!=x1)
            x1=a[x1];
        root=x1;
        while(a[x]!=root)
        {
            x1=a[x];
            a[x]=root;
            x=x1;
        }
        return root;
    }
void Union(int x, int y)
    {
        a[Find(y)]=a[Find(x)];
    }

int main()
{
    int i,n,m,cod,x,y;
    fin>>n>>m;
    for(i=1;i<=n;i++)
            a[i]=i;
    for(i=1;i<=m;i++)
    {
        fin>>cod>>x>>y;
        if(cod==1)
            Union(x,y);
        else
            if(Find(x)==Find(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
    }
    fin.close();
    fout.close();
    return 0;
}