#include <fstream>

using namespace std;
int h[100001], t[100001];
int n, m;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int FindSet(int x)
{
    while(t[x]!=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 x, y, op;
    fin>>n>>m;
    int i;

    for(i=1;i<=n;i++)
    {
        h[i]=1;
        t[i]=i;
    }
    for(i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
            if(op==1)
            {
                if(FindSet(x)!=FindSet(y))
                    UnionSet(x,y);
            }
            else if(FindSet(x)==FindSet(y)) fout<<"DA\n";
            else fout<<"NU\n";

    }
    return 0;
}