#include<cstdio>
#include<cstring>
#define N 440000
inline int read(){
int x=0;char ch=getchar();
while (ch<'0'||ch>'9') ch=getchar();
while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
return x;
}
struct node{
int y,next;
}data[N];
int fa[N],h[N],n,m,x,y,k,tmp,num=0,op[N],q[N];
bool flag[N],flag1[N];
inline void insert1(int x,int y){
data[++num].y=y;data[num].next=h[x];h[x]=num;
data[++num].y=x;data[num].next=h[y];h[y]=num;
}
inline int find(int x){
return fa[x]==x?x:fa[x]=find(fa[x]);
}
int main(){
// freopen("1197.in","r",stdin);
n=read();m=read();
memset(h,0,sizeof(h));
for (int i=1;i<=m;++i){x=read();y=read();insert1(x+1,y+1);}
k=read();
memset(flag,true,sizeof(flag));
for (int i=1;i<=k;++i) tmp=read(),flag[++tmp]=false,op[i]=tmp;
for (int i=1;i<=n;++i) fa[i]=i;
for (int i=1;i<=n;++i) {
if (flag[i]){
int x1=find(i);
for (int j=h[i];j;j=data[j].next) {
int y1=find(data[j].y);if (flag[y1]) fa[y1]=x1;
}
}
}
memset(flag1,false,sizeof(flag1));int ans=0;
for (int i=1;i<=n;++i){
if (flag[i]){
int x1=find(i);if (!flag1[x1]) ans++,flag1[x1]=true;
}
}
q[k+1]=ans;
for (int i=k;i>=1;--i){
ans++;
for (int j=h[op[i]];j;j=data[j].next){
int x1=find(op[i]),y1=find(data[j].y);if (flag[y1]) {
if (x1!=y1) ans--;fa[x1]=y1;
}
}
flag[op[i]]=true;q[i]=ans;
}
for (int i=1;i<=k+1;++i) printf("%d\n",q[i]);
return 0;
}