#include <bits/stdc++.h>

using namespace std;

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

int n,m;


int leaga(int x,int y,int v[])
{
    if(v[x]>v[y])
        v[y]=v[x];
    else v[x]=v[y];
}

int radacina(int a,int v[])
{
    if(a==v[a])
        return a;
    else return v[a]=radacina(v[a],v);
}

int main()
{
    int tata[100005];
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        tata[i]=i;
    int c,x,y;
    for(int i=1;i<=m;i++)
    {
        fin>>c>>x>>y;
        if(c==1)
        {
            if(radacina(x,tata)!=radacina(y,tata))
                leaga(radacina(x,tata),radacina(y,tata),tata);
        }
        if(c==2)
        {
            if(radacina(x,tata)==radacina(y,tata))
                fout<<"DA\n";
            else fout<<"NU\n";
        }
    }
    return 0;
}