#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
const int MAXN=100001;
int n,m;
struct DSU {
    int parent[MAXN];
    DSU(){
        for (int i=0; i<=n; ++i) parent[i]=i;
    }
    int findset(int u) {
        if (u!=parent[u]) return parent[u]=findset(parent[u]);
        return u;
    }
    void uniteset(int u,int v) {
        int findu=findset(u),findv=findset(v);
        if (findu!=findv) parent[findu]=findv;
    }
};
int main() {
    cin>>n>>m;
    DSU dsu;
    for (int i=1; i<=m; ++i) {
        int type,u,v;
        cin>>type>>u>>v;
        if (type==1) {
            dsu.uniteset(u,v);
        }
        if (type==2) {
            if (dsu.findset(u)==dsu.findset(v)) cout<<"DA\n";
            else cout<<"NU\n";
        }
    }
}