#include <fstream>
#include <queue>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n,m,t[100005],l[100005];
int radacina(int x)
{
    while(t[x]!=x)
        x=t[x];
    return x;
}
int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        t[i]=i,l[i]=1;
    for(int i=1; i<=m; i++)
    {
        int cer,x,y;
        cin>>cer>>x>>y;
        if(cer==1)
        {
            int rx=radacina(x);
            int ry=radacina(y);
            if(l[x]<=l[y])
            {
                l[y]+=l[x];
                t[x]=y;
            }
            else
            {
                l[x]+=l[y];
                t[y]=x;
            }
        }
        else
        {
            int rx=radacina(x);
            int ry=radacina(y);
            if(rx==ry)
                cout<<"DA";
            else
                cout<<"NU";
            cout<<'\n';
        }
    }
    return 0;
}