题目链接：https://www.lydsy.com/JudgeOnline/problem.php?id=1015
思路：这题如果要每次都在线查询的话，很明显，会T的爸妈都不认识，所以要离线做，删掉一个点明显没有加上一个点简单，所以反向加入每一个星球就好了。（编号是从0开始的，别被坑了emmm）
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(998244353)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int n,m,fa[400008],ans,x,y,k,a[400008],s[400008];
bool vis[400008];
P c[400008];
vector<int>g[400008];
int fid(int x)
{
int a=x,b;
while(fa[a]!=a) a=fa[a];
while(x!=a) b=fa[x],fa[x]=a,x=b;
return a;
}
int main()
{
cin.tie(0);
cout.tie(0);
cin>>n>>m;
FOR(i,0,n-1) fa[i]=i;
FOR(i,1,m)
{
si(x),si(y);
c[i].first=x,c[i].second=y;
g[x].pb(y);
g[y].pb(x);
}
cin>>k;
FOR(i,1,k) si(a[i]),vis[a[i]]=1;
FOR(i,1,m)
{
x=c[i].first,y=c[i].second;
if(!vis[x]&&!vis[y]&&fid(x)!=fid(y)) fa[fid(x)]=fid(y);
}
FOR(i,0,n-1)
if(fid(i)==i&&!vis[i]) ans++;
FOL(i,k,0)
{
s[i]=ans;
vis[a[i]]=0;
if(!g[a[i]].empty())
{
for(int j=0;j<g[a[i]].size();j++)
{
if(!vis[g[a[i]][j]])
{
if(fid(g[a[i]][j])!=fid(a[i])) fa[fid(a[i])]=fid(g[a[i]][j]),ans--;
}
}
}
ans++;
}
FOR(i,0,k) printf("%d\n",s[i]);
return 0;
}