#include <bits/stdc++.h>
#define N 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,q,op,x,y;
int t[N],h[N];
int Find(int a)
{
    if(t[a]==0) return a;
    return Find(t[a]);
}
void Union(int a,int b)
{
    int x=Find(a);
    int y=Find(b);
    if(h[x]<h[y]) t[x]=y;
    else if(h[x]>h[y]) t[y]=x;
    else t[x]=y, h[y]++;
}
int main() {
    fin>>n>>q;
    for(int i=1; i<=q; i++)
    {
        fin>>op>>x>>y;
        if(op==1) Union(x,y);
        else fout<<((Find(x)==Find(y))?"DA":"NU")<<"\n";
    }
    return 0;
}