#include <fstream>

using namespace std;

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

int n,m,x,tata[100002],grad[100002],y,z;

int findFather (int nod){
    if (tata[nod]==nod){
        return nod;
    }
    tata[nod]=findFather(tata[nod]);
    return tata[nod];
}

int main () {
    fin>>n>>m;

    for (int i=1; i<=n; i++){
        tata[i]=i;
        grad[i]=1;
    }

    for (int i=1; i<=m; i++){
        fin>>x;
        if (x==1){
            fin>>y>>z;
            int fy=findFather(y);
            int fz=findFather(z);
            if (fy!=fz){
                if (grad[fy]<grad[fz]){
                    tata[fy]=fz;
                    grad[fz]+=grad[fy];
                }
                else{
                    tata[fz]=y;
                    grad[fy]+=grad[fz];
                }
            }
        }
        else{
            fin>>y>>z;
            int fy=findFather(y);
            int fz=findFather(z);
            if (fy==fz){
                fout<<"DA\n";
            }
            else{
                fout<<"NU\n";
            }
        }

    }

    return 0;
}