#include <bits/stdc++.h>

using namespace std;
int n,m,t[100003];

int Find(int x)
{
    int aux,c=x;
    while(t[x]!=0)
        x=t[x];
    while(t[c]!=0)
    {
        aux=t[c];
        t[c]=x;
        c=aux;
    }
    return x;
}

void Union(int x, int y)
{
    t[x]=y;
}
int main()
{
    int i,op,x,y;
    ifstream fin("disjoint.in");
    fin>>n>>m;
    ofstream fout("disjoint.out");
    for(i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
        if(op==1) Union(x,y);
        else
            if(Find(x)==Find(y)) fout<<"DA\n";
            else fout<<"NU\n";
    }
    fin.close();
    fout.close();
    return 0;
}