#include <iostream>
using namespace std;
const int maxn = 1005;

int idx[maxn];
int sz[maxn];

void init() {
    for(int i = 0; i < maxn; i++) {
        idx[i] = i;
        sz[i] = 1;
    }
}

int find_root(int x) {
    while(x != idx[x]) {
        idx[x] = idx[idx[x]];
        x = idx[x];
    }

    return x;
}


void union_set(int A, int B) {
    int rootA = find_root(A);
    int rootB = find_root(B);

    if(rootA != rootB) {
        if(sz[rootA] < sz[rootB]) {
            idx[rootA] = idx[rootB];
            sz[rootB] += sz[rootA];
        }
        else {
            idx[rootB] = idx[rootA];
            sz[rootA] += sz[rootB];
        }
    }

}

bool check_set(int A, int B) {
    return (find_root(A) == find_root(B));
}
int main() {
    init();

    while(true) {
        string s;
        cin >> s;

        int A, B;
        cin >> A >> B;
        if(s == "union") {
            union_set(A, B);
        }
        else if(s == "check") {
            if(check_set(A, B)) {
                cout << "YES" << endl;
            }
            else {
                cout << "NO" << endl;
            }
        }
    }



    return 0;
}