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

int idx[maxn];

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

void union_set(int A, int B) {
    int rootA = idx[A];

    for(int i = 0; i < maxn; i++) {
        if(idx[i] == rootA) {
            idx[i] = idx[B];
        }
    }
}

bool check_set(int A, int B) {
    return (idx[A] == idx[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;
}