#include <bits/stdc++.h>
using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

vector<int> a[100005];
bitset<100005> viz;
int n, x, y, m, p;

void DFS(int k)
{
    viz[k] = 1;
    for(int w : a[k])
        if(viz[w] == 0) DFS(w);
}

int main()
{
    int i, j;
    fin >> n >> m;
    for(i=1;i<=m;i++)
    {
        fin >> p >> x >> y;
        if(p == 1)
        {
            a[x].push_back(y);
            a[y].push_back(x);
        }
        else
        {
            DFS(x);
            if(viz[y] == 1) fout << "DA\n";
            else fout << "NU\n";
            for(j=1;j<=n;j++)
                viz[i] = 0;
        }
    }
    fin.close();
    fout.close();
    return 0;
}