#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int i,n,m,op,t[100100],x,y;
void update(int x, int y){

    while(t[x] > 0)
        x=t[x];
    while(t[y] > 0)
        y=t[y];
    if(t[x]<=t[y]){
        t[x]+=t[y];
        t[y]=x;
    }
    else
        if(t[x]>t[y]){
            t[y]+=t[x];
            t[x]=y;
        }
}
void query(int x, int y){

    while(t[x] > 0)
        x=t[x];
    while(t[y] > 0)
        y=t[y];
    if(y == x)
        fout<<"DA"<<'\n';
    else
        fout<<"NU"<<'\n';


}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        t[i]=-1;
    for(i=1;i<=m;i++){
        fin>>op>>x>>y;
        if(op == 1)
            update(x,y);
        else
            query(x,y);
    }
    return 0;
}