#include<algorithm>
using namespace std;
#include<vector>
#include<queue>

#define DIM 100005
#define pb push_back

vector <int> lst[DIM];
queue <int> c;

int viz[DIM],n;
int bfs (int x,int y)
{
    int i,nr;
    c.push (x);
    for(i=1;i<=n;++i)
        viz[i]=0;
    viz[x]=1;
    while(!c.empty ())
    {
        nr=c.front ();
        for(i=0;i<lst[nr].size ();++i)
            if(!viz[lst[nr][i]])
            {
                viz[lst[nr][i]]=1;
                if(lst[nr][i]==y)
                    return 1;
                c.push (lst[nr][i]);
            }
        c.pop ();
    }
    return 0;
}
int main ()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int i,m,q,x,y;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&q,&x,&y);
        if(q==1)
        {
            lst[x].push_back (y);
            lst[y].push_back (x);
        }
        else
        {
            if(bfs(x,y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}