离线的并查集，倒过来搜
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
const int M=400001;
int n,f[M],s[M],ans2[M],w[M],sum,head[M],nex[M],to[M],vis[M],tot,m,k,ff[M],ans;
int x[M],y[M];
int find(int x){if(f[x]==x)return x;int fx=find(f[x]);return f[x]=fx;
}
int add(int x,int y){tot++;nex[tot]=head[x];to[tot]=y;head[x]=tot;
}
int main()
{scanf("%d%d",&n,&m); for(int i=0;i<n;i++) f[i]=i;for(int i=1;i<=m;i++){scanf("%d%d",&x[i],&y[i]);add(x[i],y[i]);add(y[i],x[i]);}scanf("%d",&k);for(int i=1;i<=k;i++)scanf("%d",&s[i]),ff[s[i]]=1;for(int i=1;i<=m;i++)if(ff[x[i]]==0&&ff[y[i]]==0){int fx=find(x[i]);int fy=find(y[i]);f[fx]=fy;}for(int i=0;i<n;i++){int fi=find(i);{if(!vis[fi]&&!ff[i]){ans++;vis[fi]=1;}}}for(int j=k;j>=1;j--){//printf("%d\n",ans);ans2[j]=ans;ff[s[j]]=0;int cnt=0;for(int i=head[s[j]];i;i=nex[i]){int tmp=to[i];if(ff[tmp])continue;int ftmp=find(tmp);if(s[j]!=ftmp){cnt++;f[ftmp]=s[j];}}ans-=cnt-1;} printf("%d\n",ans);for(int i=1;i<=k;i++)printf("%d\n",ans2[i]);
}