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