#include <bits/stdc++.h>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

vector <int> v[100005];
int p[100005],cod,x,y;

int dfs(int nod)
{
    if(p[nod]!=nod)
        p[nod]=dfs(p[nod]);
    return p[nod];
}

int par(int nod)
{
    while(p[nod]!=nod)
        nod=par(p[nod]);
    return nod;
}

int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        p[i]=i;

    for(int i=1;i<=m;i++)
    {
        fin>>cod>>x>>y;
        if(cod==1)
            p[par(y)]=par(x);
        else
            if(dfs(y)==dfs(x))
            fout<<"DA"<<'\n';
            else
            fout<<"NU"<<'\n';
    }
    return 0;
}