#include <fstream>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int n, m, t[200010], rx, ry, val, x, y;

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

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