разрезание графчика (кастрация)

#include <iostream>
#include <string>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <vector>
#include <set>
#include <iterator>
#include <map>
#include <iomanip>
#define int long long
#define fir first
#define sec second
#define pb push_back
#define double long double
#define endl "\n"
#define un unsigned
#define INF 1000000000
using namespace std;

vector <int> p(1000005); // dsu
int mas[3][1000005];
int res[1000005];

int repr(int n)
{
    if (n == p[n]) return n;

    return p[n] = repr(p[n]);
}

int Union(int x, int y)
{
    int x1 = repr(x), y1 = repr(y);

    p[x1] = y1;

    return (x1 == y1);

}

signed main()
{
    ios_base::sync_with_stdio();
    cin.tie(0);
    cout.tie(0);

    int n, m, q;
    cin >> n >> m >> q;

    vector <vector<int>> gr(100000);

    for (int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;

        gr[a].pb(b);
        gr[b].pb(a);
    }

    for (int i = 0; i < q; i++)
    {
        string s;
        cin >> s;

        int a, b;
        cin >> mas[1][i] >> mas[2][i];

        if (s == "ask")
            mas[0][i] = 1;
        else
            mas[0][i] = 0;
    }

    for (int i = 1; i <= n; i++)
    {
        p[i] = i;
    }

    for (int i = q - 1; i >= 0; i--)
    {
        if (mas[0][i] == 1)
        {
            res[i] = (repr(mas[1][i]) == repr(mas[2][i]));
        }
        else
        {
            Union(mas[1][i], mas[2][i]);
        }
    }

    for (int i = 0; i < q; i++)
    {
        if (mas[0][i] == 1)
        {
            if (res[i] == 1)
            {
                cout << "YES" << endl;
            }
            else
            {
                cout << "NO" << endl;
            }
        }

    }

    return 0;

}