#include<fstream>
#define maxn 100009
using namespace std;
int n,m,T[maxn];
int tata(int x)
{
    while(x!=T[x])
        x=T[x];
    return x;
}
void unire(int x,int y)
{
    T[tata(x)]=tata(y);
}
int main()
{
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        T[i]=i;
    int cod,x,y;
    for(;m;--m)
    {
        fin>>cod>>x>>y;
        if(cod==1)
            unire(x,y);
        if(cod==2)
            if(tata(T[x])==tata(T[y]))
                fout<<"DA"<<endl;
            else
                fout<<"NU"<<endl;
    }
    return 0;
}