#include <fstream>

using namespace std;
//chestii
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int t[100020];
int h[100020];
int findset(int x)
{
    while(x!=t[x])
        x=t[x];
    return x;
}
void unite(int x,int y)
{
    if(h[x]==h[y])
        h[x]++,t[y]=x;
    else
        if(h[x]>h[y]) t[y]=x;
    else
        t[x]=y;
}
int main()
{
    int tip,n,m,x,y;
    in>>n>>m;
    for(int i=1;i<=n;++i)
    {
        h[i]=1;
        t[i]=i;
    }
    for(int i=1;i<=m;++i)
    {
        in>>tip>>x>>y;
        int tx=findset(x);
        int ty=findset(y);
        if(tip==1){
            unite(tx,ty);}
            else{
                if(tx==ty) out<<"DA";
            else
                out<<"NU";
                out<<'\n';      
    } 
    }
    return 0;
}