#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n, m, t[1000], rx, ry, op, x, y;
int rad(int x)
{
    while(t[x]>0)
        x=t[x];
    return x;
}
int main()
{
    f>>n>>m;
    for(int i;i<=n;i++)
        t[i]=-1;
    for(;m--;)
    {
        f>>op>>x>>y;
        rx=rad(x);
        ry=rad(y);
        if(op==2)
            g<<(rx==ry? "DA\n":"NU\n");
        else
        {
            if(rx!=ry)
                if(t[rx]<t[ry])
                {
                    t[rx]+=t[ry];
                    t[ry]=rx;
                }
                else
                {
                    t[ry]+=t[rx];
                    t[rx]=ry;
                }
        }
    }
    return 0;
}