#include <bits/stdc++.h>
#define nmax 32002
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m;
int T[100002];
int Radacina(int k)
{   if(T[k]==k)
        return k;
    else
        return Radacina(T[k]);
}
void Unire(int k, int p)
{
    int rk = Radacina(k), rp = Radacina(p);
    if(rk != rp)
        T[rk] = rp;
}
void cerinta1(int x, int y)
{   int rx=Radacina(x);
    int ry=Radacina(y);
    if(rx!=ry) T[x]=ry;
}
void cerinta2(int x, int y)
{   int rx=Radacina(x);
    int ry=Radacina(y);
    if(rx==ry) g<<"DA\n"; else g<<"NU\n";
}
int main()
{   f>>n>>m;
    for(int i=1; i<=n; i++) T[i]=i;
    for(int op,a,b; m; m--)
        {   f>>op>>a>>b;
            if(op==1) cerinta1(a,b);
            if(op==2) cerinta2(a,b);
        }
    g.close();
    f.close();
    return 0;
}