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