#include <fstream>
#include <vector>
#define Nmax 100001
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int ap[Nmax],m[Nmax],n,k;
int reunire(int x)
{
    if (ap[x]==x)
        return x;
    ap[x]=reunire(ap[x]);
    return ap[x];
}
int main()
{
    int a,b,i,c;
    fin>>n>>k;
    for (i=1;i<=n;i++)
    {
        ap[i]=i;
        m[i]=1;
    }
    for (i=1;i<=k;i++)
    {
        fin>>c>>a>>b;
        if (c==1)
        {
            if (m[a]>=m[b])
            {
                m[a]+=m[b];
                ap[b]=a;
            }
            else if (m[a]<m[b]){
                m[b]+=m[a];
                ap[a]=b;
            }
        }
        if (c==2)
        {
            if (reunire(a)==reunire(b))
                fout<<"DA"<<"\n";
            else
                fout<<"NU"<<"\n";
        }
    }
    return 0;
}