#include <fstream>
#define NMAX 100000

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m, c, x, y, t, f1, f2;
int h[NMAX], tata[NMAX];
void Union(int x, int y)
{
    if (h[x]>h[y])
        tata[y]=x;
    else
    {
        if (h[x]==h[y]) h[y]++;
            tata[x]=y;
    }
}
int Find(int x)
{
    int rad=x, y;
    while (tata[rad])
        rad=tata[rad];
    y=x;
    while (y!=rad)
    {
        t=tata[y];
        tata[y]=rad;
        y=t;
    }
    return rad;
}

int main()
{
    int i;
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>c>>x>>y;
        if (c==1)
            Union(x, y);
        else
        {
            f1=Find(x); f2=Find(y);
            if (f1==f2 || f1==y || f2==x)

            fout<<"DA"<<'\n';
        else fout<<"NU"<<'\n';}
    }
    return 0;
}