#include <iostream>
#include <fstream>

using namespace std;

int p[100001];

int parinte(int nod)
{
    if(p[nod]==nod) return nod;
    return p[nod]=parinte(p[nod]);
}

void unire(int x,int y)
{
    p[parinte(x)]=parinte(y);
}

int main()
{
    ifstream in ("disjoint.in");
    ofstream out ("disjoint.out");
    int n,m;
    in>>n>>m;
    for(int i=1;i<=n;i++)
        p[i]=i;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        in>>a>>b>>c;
        if (a==1)
            unire(b,c);
        else
        {
            if (parinte(b)==parinte(c)) out<<"DA"<<"\n";
            else out<<"NU"<<"\n";
        }
    }
}