#include <fstream>
#define NMAX 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout ("disjoint.out");
int tata[NMAX];
int h[NMAX], cerinta,n, m, a, b;
void Union(int x, int y)
{
    if (h[x]<h[y])
    {
        tata[x]=y;
    }
    else
        if (h[y]<h[x])
    {
        tata[y]=x;
    }
    else
    {
        tata[y]=x; h[y]++;
    }
}

int Find(int x)
{
    int r, y;
    r=x;
    while(tata[r]!=r) r=tata[r];
    do
    {
        y=tata[x];
        tata[x]=r;
        x=y;
    }
    while(tata[x]!=r);
    return tata[x];
}
int main()
{
    int i;

    fin>>n>>m;
    for (i=1; i<=n; i++)
    {
        h[i]=1, tata[i]=i;
    }

    for (i = 1; i<=m; i++) {
        fin>>cerinta>>a>> b; int fa=Find(a);
    int fb=Find(b);
        if (cerinta==1)
        {
            Union(fa, fb);
        } else {
            if (fa == fb) {
                fout << "DA\n";
            } else {
                fout << "NU\n";
            }
        }
    }
    return 0;
}