#include <iostream>
#include <fstream>
#define Nmax 100005

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int n, m, x, y, cod;
int tt[Nmax], rg[Nmax];

int root(int x)
{
    int r=x;
    while(r!=tt[r]) r=tt[r];

    while(x!=tt[x])
    {
        int y=tt[x];
        tt[x]=r;
        x=y;
    }
    return r;
}

void unite(int x, int y)
{

    if(rg[x] > rg[y])
        tt[y]=x;
    else tt[x]=y;
    if(rg[x] == rg[y]) rg[x]++;
}


int main()
{
    f >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        tt[i]=i;
        rg[i]=1;
    }

    for (int i = 1; i <= m; i++)
    {
        f >> cod >> x >> y;
        if(cod == 1)
        {
            int X=root(x);
            int Y=root(y);
            if(X!=Y) unite(X, Y);
        }
        else
        {
            int X=root(x);
            int Y=root(y);
            if(X!=Y) g << "NU\n";
            else g << "DA\n";
        }
    }

    return 0;
}