#include <iostream>
#include <fstream>

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


int k, n,a,b, m, v[100002];

int findx(int x)
{
    if(v[x]<0)
        return x;
    else
        return x=findx(v[x]);
}


void unionx(int a,int b){
int parenta=findx(a);
int parentb=findx(b);
if(v[parenta]>v[parentb])
    v[parentb]=parenta;
else if(v[parenta]<v[parentb])
    v[parentb]=parenta;
else{
    v[parentb]=parenta;
    v[parenta]--;
}


}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        v[i]=-1;


    for(int i=1;i<=m;i++)
    {
        fin>>k;
        if(k==1)
        {

        fin>>a>>b;
        unionx(a,b);
        }
        else if(k==2)
        {fin>>a>>b;
        if(findx(a)==findx(b))
            fout<<"DA\n";
        else fout<<"NU\n";

        }
    }


    return 0;
}