#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
#define nmax 100005
int n, m, t[nmax], rang[nmax];
int radacina(int x)
{
    int r, aux;
    r=x;
    while(t[r]!=r)
        r=t[r];
    while(t[x]!=x)
    {
        aux=t[x];
        t[x]=r;
        x=aux;
    }
    return r;
}
void uneste(int x, int y)
{
    if(rang[x]<rang[y])
        t[x]=y;
    else t[y]=x;
}
int main()
{
    int i, x, y, op;
    fin>>n>>m;
    for(i=1; i<=n; i++)
        t[i]=rang[i]=i;
    while(m)
    {
        m--;
        fin>>op>>x>>y;
        if(op==1)
            uneste(radacina(x), radacina(y));
        else if(op==2)
        {
            if(radacina(x)==radacina(y))
                fout<<"DA\n";
            else fout<<"NU\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}