Път в граф

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

class UnionFind{
    vector<int> parents;
public:
    UnionFind(int n) : parents(n){
        for(int i = 0; i < n; i++)
            parents[i] = i;
    }

    int find(int num){
        if(parents[num] == num)
            return num;
        return parents[num] = find(parents[num]);
    }
    void unite(int a, int b){
        int parentA = find(a);
        int parentB = find(b);

        if(parentA == parentB)
            return;

        parents[parentA] = parentB;
    }
};

int main() {
    int n, m, u, v, w;
    cin >> n >> m;
    UnionFind uf(n);

    for(int i = 0; i < m; i++){
        cin >> u >> v;
        uf.unite(u, v);
    }

    cin >> w;
    vector<bool> result(w);
    for(int i = 0; i < w; i++){
        cin >> u >> v;
        result[i] = (uf.find(u) == uf.find(v));
    }

    for(auto res : result){
        cout << res << " ";
    }

    return 0;
}