#include <cstdio>
#include <vector>

using namespace std;
int n, m, i, a, b, cer, ta, tb;
vector<int> v[100000];

int seek(int a)
{
    if(v[a].size() == 0)
        return a;
    return seek(v[a][0]);
}

int main()
{

    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(i = 0; i < m; i++)
    {
        scanf("%d%d%d", &cer, &a, &b);
        if(cer == 1)
        {
            ta = seek(a - 1);
            tb = seek(b - 1);
            v[tb].push_back(ta);
        }
        else
        {
            if(seek(a - 1) == seek(b - 1))
                printf("DA\n");
            else printf("NU\n");
        }
    }
    return 0;
}