#include<bits/stdc++.h>
#include<atcoder/dsu>
using namespace std;

int main(){
  using ll=long long;
  ll n,m;
  cin>>n>>m;
  vector<pair<int,int>> edge(m);
  for (int i=0;i<m;i++){
    int u,v;
    cin>>u>>v;
    u--;v--;
    edge[i]={u,v};
  }
  int q;
  cin>>q;
  vector<int> b(q);
  vector<bool> use(q,true);
  for (int i=0;i<q;i++){
    cin>>b[i];
    b[i]--;
    use[b[i]]=false;
  }
  atcoder::dsu uf(n);
  for (int i=0;i<m;i++){
    auto [u,v]=edge[i];
    if (use[i]) uf.merge(u,v);
  }
  vector<ll> ans(q);
  ans[q-1]=n*(n-1)/2;
  for (auto v:uf.groups()){
    ans[q-1]-=ll(v.size())*(v.size()-1)/2;
  }
  for (int i=q-1;i>=1;i--){
    auto [u,v]=edge[b[i]];
    ll cnt=0;
    if (!uf.same(u,v)){
      cnt=ll(uf.size(u))*uf.size(v);
      uf.merge(u,v);
    }
    if (i) ans[i-1]=ans[i];
    ans[i-1]-=cnt;
  }
  for (int i=0;i<q;i++) cout<<ans[i]<<endl;
}