#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int h[100001],t[100001],n,m;
int Find(int x)
{
    while(t[x])
        x=t[x];
    return x;
}
void Union(int x,int y)
{
    if(h[x]>h[y])
        t[y]=x;
    else
    {
        t[x]=y;
        if(h[x]==h[y])
            h[y]++;
    }
}
int main()
{
    int i,c,x,y;
fin>>n>>m;
for(i=1;i<=n;i++)
    h[i]=1;
for(i=1;i<=m;i++)
{
    fin>>c>>x>>y;
    if(c==1)
    Union(Find(x),Find(y));
    else
    {
        if(Find(x)==Find(y))
            fout<<"DA"<<"\n";
        else
            fout<<"NU"<<"\n";
    }
}
    return 0;
}