#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m, h[100001], t[100001];
int findset(int x)
{
    while(t[x]!=x)
        x=t[x];
    return x;
}

    void unionset(int x, int y)
    {
        if(h[x]==h[y])
        {
            t[y]=t[x];
            h[x]++;
        }
        else if(h[x]>h[y])
                {
                    t[y]=x;
                }
                    else t[y]=y;
    }
    int main()
    {
        int n,i, m,op, x,y;
        fin>>n>>m;
        for(i=1;i<=n;i++)
        {
            h[i]=1;
            t[i]=i;
        }
        for(i=1;i<=m;i++)
        {
            fin>>op>>x>>y;
             x=findset(x);
                 y=findset(y);
            if(op==1)
              {

                  if(x!=y)
                  unionset(x,y);
                }
            if(op==2)
            {
                if(x!=y)
                    fout<<"NU"<<endl;
                else fout<<"DA"<<endl;
            }
        }
        return 0;
    }