#include <bits/stdc++.h>
#define nmax 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int a[nmax],t[nmax],n,m;
inline void Union(int x,int y)
{
    t[y]=x;
}
inline int Find(int x)
{
    int rad,y;
    rad=x;
    while(t[rad])
        rad=t[rad];
    while(x!=rad)
    {
        y=t[x];
        t[x]=rad;
        x=y;
    }
    return x;
}
int main()
{
    int i,op,x,y;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>op>>x>>y;
        x=Find(x);
        y=Find(y);
        if(op==1 && x!=y)
            Union(x,y);
        else if(op==2)
        {
            if(x!=y)
                fout<<"NU\n";
            else fout<<"DA\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}