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