#include <fstream>
#include <cmath>
#include <queue>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,tt[100001],sz[100001];
int root(int x)
{
    while(tt[x]!=0) x=tt[x];
    return x;
}
void un(int x, int y)
{
    int rx=root(x);
    int ry=root(y);
    if(sz[rx]>sz[ry]) swap(rx,ry);
    tt[ry]=rx;
    sz[rx]+=sz[ry];
}
int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;i++) sz[i]=1;
    for(int i=1;i<=m;i++)
    {
        int op,x,y;
        fin >> op >> x >> y;
        if(op==1)
            un(x,y);
        else
        {
            if(root(x)==root(y)) fout << "DA\n";
            else fout << "NU\n";
        }
    }
    return 0;
}