#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,r[100010],op,a,b,i;

int cauta(int x)
{
    int t=x;
    while(r[t]!=t)
        t=r[t];
    int y=x;
    while(y!=t)
    {
        int k=y;
        y=r[y];
        r[k]=t;
    }
    return t;
}

void unire(int a,int b)
{
    int rx=cauta(a);
    int ry=cauta(b);
    r[rx]=ry;
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        r[i]=i;
    for(i=1;i<=m;i++)
    {
        fin>>op>>a>>b;
        if(op==2)
        {
            if(cauta(a)==cauta(b))
                fout<<"DA\n";
            else fout<<"NU\n";
        }
        else unire(a,b);
    }
    return 0;
}