#include <fstream>
#define MX 100001
using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m;
int rad[MX], l[MX];

inline int Find(int x)
{
    int r,t;
    t = x;
    while(rad[t] != 0)
    {
        t = rad[t];
    }
    r = t;

    while(x != r)
    {
        t = rad[x];
        rad[x] = r;
        x = t;
    }

    return r;
}

void Union(int x, int y)
{
    if(l[x] <= l[y])
    {
        rad[Find(x)] = Find(y);
        if(l[x] == l[y])
        {
            l[y]++;
        }
    }
    else
    {
        rad[Find(y)] = Find(x);
    }
}

int main()
{
    fin>>n>>m;
    int i,j,x,y;
    for(i=1; i<=n; i++)
    {
        l[i] = 1;
    }

    for(i=1; i<=m; i++)
    {
        fin>>j>>x>>y;
        if(j == 1)
        {
            Union(x, y);
        }
        else
        {
            if(Find(x) == Find(y))
            {
                fout<<"DA\n";
            }
            else
            {
                fout<<"NU\n";
            }
        }
    }

    fin.close(); fout.close();
    return 0;
}