Паутина Ананси

#pragma once
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define rsor(n) n.rbegin(), n.rend()
#define mp make_pair
#define files freopen("input.txt", "rt", stdin); freopen("output.txt", "wt", stdout)
#define p(T) pair<T,T>
#define toch(x) cout.precision(x), cout.setf(ios::fixed)
#define znac(l) abs(l)/l
#define IOS ios::sync_with_stdio(false)
#define IOSB cin.tie(0), cout.tie(0);
const ll ok = ll(1e9 + 7);

int dsu_get(ll v, vector<ll> &pt) {
    return (v == pt[v]) ? v : (pt[v] = dsu_get(pt[v],pt));
}

void dsu_unite(ll a, ll b, vector<ll> &pt, vector<ll>&ras) {
    a = dsu_get(a,pt);
    b = dsu_get(b,pt);
    if (ras[a]<ras[b])
        swap(a, b);
    if (a != b)
        pt[a] = b;
    if (ras[a] == ras[b])
        ras[a]++;
}

void dfs(ll a, vector<vector<ll>>mst, vector<bool> &used)
{
    stack<ll>next;
    next.push(a);
    while (!next.empty())
    {
        ll v = next.top();
        next.pop();
        used[v] = 1;
        for (int i = 0; i < mst[v].size(); i++)
        {
            if (!used[mst[v][i]])
            {
                next.push(mst[v][i]);
            }
        }
    }
}
int main()
{
    IOSB;
    IOS;
#ifdef TheCompiler
    files;
#endif
    ll n, k;
    cin >> n >> k;
    vector<ll> pt(n+1);
    for (int i = 1; i <= n; i++)
    {
        pt[i] = i;
    }
    vector<p(ll)>graf(k);

    for (int i = 1; i <= k; i++)
    {
        ll a, b;
        cin >> a >> b;
        graf[i-1]={a,b};
    }
    ll q;
    cin >> q;
    ll compt = n;
    vector<ll>zap(q);
    vector<bool>us(k, 0);
    vector<ll>ras(n + 1, 0);
    for (int i = 1; i <= q; i++)
    {
        ll p;
        cin >> p;
        us[p - 1] = 1;
        zap[i-1]=p-1;
    }
    for (int i = 0; i < graf.size(); i++)
    {
        if(!us[i])
            if (dsu_get(graf[i].first, pt) != dsu_get(graf[i].second, pt))
            {
                compt--;
                dsu_unite(graf[i].first, graf[i].second, pt,ras);
            }
    }
    vector <ll>ans(q);
    for (int i = zap.size() - 1; i >= 0; i--)
    {
        ans[i]=(compt);
        if (dsu_get(graf[zap[i]].first, pt) != dsu_get(graf[zap[i]].second, pt))
        {
            compt--;
            dsu_unite(graf[zap[i]].first, graf[zap[i]].second, pt,ras);
        }
    }
    for (int i = 0; i <ans.size(); i++)
    {
        cout << ans[i] << " ";
    }
    return 0;
}