#include <fstream>

#define nMax 100001
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m;
int Root[nMax];
int getRoot(int node)
{
    return (Root[node]<0 ? node : Root[node]=getRoot(Root[node]));
}
void solve()
{
    int op, a, b;
    for(int i=1;i<=n;i++)
        Root[i]=-1;

    for(int i=1;i<=m;i++)
    {
        fin>>op>>a>>b;
        int val1=getRoot(a);
        int val2=getRoot(b);

        if(op==1)
        {
            switch(Root[val1]-Root[val2]<=0)
            {
                case 1:Root[val1]+=Root[val2];Root[val2]=val1;break;
                case 0:Root[val2]+=Root[val1];Root[val1]=val2;break;
            }
            continue;
        }
        if(val1==val2)
            fout<<"DA";
        else
            fout<<"NU";

        fout<<'\n';
    }
}
int main()
{
    fin>>n>>m;
    solve();
    return 0;
}