#include <bits/stdc++.h>
#define nMax 100005

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int n, m, t, x, y, p[nMax];

int Find(int x)
{
    int r=x;
    while(r!=p[r])
        r=p[r];
    while(r!=p[x])
    {
        int tmp=p[x];
        p[x]=r;
        x=tmp;
    }
    return r;
}

void Union(int x, int y)
{
    int rx=Find(x);
    int ry=Find(y);
    if(rx!=ry)
        p[rx]=ry;
}

int main()
{
    fin >> n >> m;
    for(int i=1; i<=n; i++)
        p[i]=i;
    while(m--)
    {
        fin >> t >> x >> y;
        if(t==1)
            Union(x, y);
        else if(Find(x)==Find(y))
            fout << "DA\n";
        else
            fout << "NU\n";
    }
    return 0;
}