#include <bits/stdc++.h>
#define nmax 32002
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m;
int T[100002],R[100002];
int Find(int k)
{   if(T[k]==k) return k;
    T[k]=Find(T[k]);
    return T[k];
}
void unire(int x, int y)
{   int rx=Find(x);
    int ry=Find(y);
    T[x]=ry;
    if(R[rx]>R[ry]) T[y]=x; else T[x]=y;
    if(R[rx]==R[ry]) R[y]++;
}
void cerinta2(int x, int y)
{   int rx=Find(x);
    int ry=Find(y);
    if(rx==ry) g<<"DA\n"; else g<<"NU\n";
}
int main()
{   f>>n>>m;
    for(int i=1; i<=n; i++) {T[i]=i; R[i]=1;}
    for(int op,a,b; m; m--)
        {   f>>op>>a>>b;
            if(op==1) unire(a,b);
            if(op==2) cerinta2(a,b);
        }
    g.close();
    f.close();
    return 0;
}