#include <bits/stdc++.h>
#define nmax 100009
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int a[nmax],t[nmax],h[nmax];
int n,m,i,c,x,y;
int Find(int x)
{
    int r=x;
    while(t[r])
        r=t[r];
    int y=x;
    while(y!=r)
    {
        int t1=t[y];
        t[y]=r;
        y=t1;
    }
    return r;
}
void unite(int x,int y)
{
    int c;
    int r1=Find(x),r2=Find(y);
    if(h[r1]>h[r2])
        t[r1]=y,c=y;
    else
        t[r2]=x,c=x;
    if(h[r1]==h[r2])
        h[c]++;
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        h[1]=1;
    for(i=1;i<=m;i++)
    {
        fin>>c>>x>>y;
        if(c==1)
            unite(x,y);
        else
            if(Find(x)==Find(y))
                fout<<"DA"<<'\n';
            else
                fout<<"NU"<<'\n';
    }
    return 0;
}