#include <fstream>
#include <vector>
#include <utility>
#include <queue>
#include <bitset>
using namespace std;
ifstream fcin("disjoint.in");
ofstream fout("disjoint.out");
int n,q,c,ap[100001],nr,x,y;
vector <int> v[100001];
inline string bfs(int nod, int fin)
{
    queue <int> q;
    q.push(nod);
    ap[nod]=nr;
    while(!q.empty())
    {
        int p=q.front(); q.pop();
        for(int i=0; i<v[p].size(); i++)
        {
            if(v[p][i]==fin) return "DA";
            if(ap[v[p][i]]!=p)
            {
                ap[v[p][i]]=nr;
                q.push(v[p][i]);
            }
        }
    }
    return "NU";
}
int main()
{
    fcin>>n>>q;
    while(q--)
    {
        fcin>>c>>x>>y;
        if(c==1)
        {
            v[x].push_back(y);
            v[y].push_back(x);
        }
        if(c==2)
        {
            nr++;
            fout<<bfs(x,y)<<'\n';
        }
    }
    return 0;
}