#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n, m, z, x, y, t[100010], i, rx, ry;

int rad(int x){
    while(t[x]>0)
        x=t[x];
    return x;
}

int main(){
    f>>n>>m;
    for(i=1; i<=n; i++)
        t[i]=-1;
    for(i=1; i<=m; i++)
    {
        f>>z>>x>>y;
        rx=rad(x);
        ry=rad(y);
        if(z==1)
        {
            if(t[rx]<t[ry])
            {
                t[rx]+=t[ry];
                t[ry]=rx;
            }
            else
            {
                t[ry]+=t[rx];
                t[rx]=ry;
            }
        }
        else
        {
            if(rx==ry)
                g<<"DA\n";
            else
                g<<"NU\n";
        }
    }
    return 0;
}