#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<vector>

 #define LL long long

 #define rg register

 #define N 400010

 using namespace std;

 int n,m,k,cnt,tot,last[N],fa[N],q[N],ans[N];

 bool v[N];

 struct edge{int to,pre;}e[N<<];

 inline int read(){

     int k=,f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

     while(''<=c&&c<='')k=k*+c-'',c=getchar();

     return k*f;

 }

 int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}

 int main(){

     n=read(); m=read();

     for(rg int i=;i<=n;i++) fa[i]=i;

     for(rg int i=;i<=m;i++){

         int u=read()+,v=read()+;

         e[++tot]=(edge){u,last[v]}; last[v]=tot;

         e[++tot]=(edge){v,last[u]}; last[u]=tot;

     }

     k=read();

     for(rg int i=;i<=k;i++) v[q[i]=read()+]=;

     for(rg int now=;now<=n;now++)if(!v[now]){

         cnt++;

         for(rg int i=last[now],to;i;i=e[i].pre)if(!v[to=e[i].to]){

             if(find(now)!=find(to)){

                 fa[find(now)]=find(to);

                 cnt--;

             }

         }

     }

     ans[k+]=cnt;

     for(rg int j=k;j;j--){

         int now=q[j];

         cnt++; v[now]=;

         for(rg int i=last[now],to;i;i=e[i].pre)if(!v[to=e[i].to]){

             if(find(now)!=find(to)){

                 fa[find(now)]=find(to);

                 cnt--;

             }

         }

         ans[j]=cnt;

     }

     for(rg int i=;i<=k+;i++) printf("%d\n",ans[i]);

     return ;

 }