#include <bits/stdc++.h>
#define Nmax 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,t[Nmax];
inline int Find(int k)
{
    int rad,z;
    rad=k;
    while(t[rad]!=0) rad=t[rad];
    while(k!=rad)
    {
        z=k;
        k=t[k];
        t[z]=rad;
    }
    return rad;
}
inline void Union(int x,int y)
{
    t[x]=y;
}
void Citire()
{
    int i,op,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
        x=Find(x);
        y=Find(y);
        if(op==1) Union(x,y);
        else
        {
            if(x!=y) fout<<"NU\n";
            else fout<<"DA\n";
        }
    }
    fout.close();
}
int main()
{
    Citire();
    return 0;
}