#include<bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int a,b,t,i,n,m,x,y,f[100010];
int rad(int nod)
{
    if(f[nod]<0) return nod;
    return f[nod]=rad(f[nod]);
}
int main()
{
    fin>>n>>m;for(i=1;i<=n;i++) f[i]=-1;
    for(i=1;i<=m;i++)
    {
        fin>>t>>a>>b;
        x=rad(a);y=rad(b);
        if(t==1)
        {
            if(f[x]<f[y]) swap(x,y);
            f[x]+=f[y];f[y]=x;
        }
        else if(x==y) fout<<"DA\n"; else fout<<"NU\n";
    }
    return 0;
}