#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int tata[100009],grad[100009];

int find_father(int node)
{
    if(tata[node]==node)
        return node;
    tata[node]=find_father(tata[node]);
    return tata[node];
}

int main()
{
    int n,m,tip_operatie,x,y;
    fin>>n>>m;
    for(int i=0; i<n; i++)
    {
        tata[i]=i;
        grad[i]=1;
    }
    for(int i=0; i<m; i++)
    {
        fin>>tip_operatie;
        fin>>x>>y;
        if(tip_operatie==1)
        {
            int fx=find_father(x);
            int fy=find_father(y);
            if(grad[fx]<grad[fy])
            {
                tata[fx]=fy;
                grad[fy]+=grad[fx];
            }
            else
            {
                tata[fy]=fx;
                grad[fx]+=grad[fy];
            }
        }
        if(tip_operatie==2)
        {
            int father_x=find_father(x);
            int father_y=find_father(y);
            if(father_x==father_y)
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}