#include <fstream>

using namespace std;
int t[100000],h[100000];
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int FindSet(int x)
{
    while(x!=t[x])
        x=t[x];
    return x;
}
void UnionSet(int x,int y)
{
    if(h[x]==h[y])
    {
        t[y]=x;
        h[x]++;
    }
    else
        if(h[x]>h[y])
            t[y]=x;
        else
            t[x]=y;
}
int main()
{
    int n,m,u,v,x,i;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        t[i]=i;
        h[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        fin>>x>>u>>v;
        if(x==2)
           if( FindSet(u)==FindSet(v))
                fout<<"DA\n";
           else
                fout<<"NU\n";
        else
            UnionSet(u,v);



    }
    return 0;
}