#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[100005],n,m,C,x,y,aux,rad;
int find(int k)
{
    if(t[k]==k)
        return k;
    return t[k]=find(t[k]);
}
void uniune(int a, int b)
{
    int ai=find(a);
    int bi=find(b);
    t[ai]=bi;
}
int main()
{
    fin>>n>>m;
    while(m--)
    {
        fin>>C;
        fin>>x>>y;
        if(C==1)
        {
            uniune(x,y);
        }
        if(C==2)
            if(find(x)==find(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
    }
    fin.close();
    fout.close();
    return 0;
}