#include 

using namespace std;
const int maxn = 105;
int root[maxn];
int find_root(int x) {
    while(root[x] != x) {
        root[x] = root[root[x]];
        x = root[x];
    }
    return x;
}
bool find(int A, int B) {
    if(find_root(A) == find_root(B)) {
        return true;
    }
    return false;
}
void union_two_elements(int A, int B) {
    int root_A = find_root(A);
    int root_B = find_root(B);
    root[root_A] = root_B;
}
int main() {
    for(int i = 0; i < maxn; i++) {
        root[i] = i;
    }
    while(true) {
        string s;
        cin >> s;
        if(s == "u") {
            int a, b;
            cin >> a >> b;
            union_two_elements(a, b);
        }
        else {
            int a, b;
            cin >> a >> b;
            if(find(a, b)) {
                cout << "YES\n";
            }
            else {
                cout << "NO\n";
            }
        }
    }
    return 0;
}