#include <bits/stdc++.h>
using namespace std;

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

int t[100001],Rang[100001];

int radacina(int k){
    if(t[k] == 0)
        return k;
    else{
        int x=radacina(t[k]);
        t[k]=x;
        return x;
    }
}

void unire(int p,int k){
    int rk=radacina(k),rp=radacina(p);
    if(rk!=rp){
        if(Rang[rk]>Rang [rp])
            t[rp]=rk;
        else{
            t[rk]=rp;
            if(Rang[rp]==Rang[rk])
                Rang[rp]++;
}
    }
}

int main()
{
	int n,m;
	fin>>n>>m;
	for(int i=1;i<=n;++i)
        Rang[i]=i;
	for(int i=1;i<=m;++i){
        int x,y,z;
        fin>>x>>y>>z;
        if(x==1){
            unire(y,z);
        }
        else{
            if(radacina(y)==radacina(z))
                fout<<"DA"<<'\n';
            else
                fout<<"NU"<<'\n';
        }
	}
	return 0;
}