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

int main(){
    int n,m;cin>>n>>m;
    vector<int> u(m),v(m);
    for(int i=0;i<m;i++){
        cin>>u[i]>>v[i];
        u[i]--;v[i]--;
    }
    int q;cin>>q;
    vector<int> b(q);
    vector<int> rem(m,1);
    for(int i=0;i<q;i++){
        cin>>b[i];b[i]--;
        rem[b[i]]=0;
    }
    atcoder::dsu uf(n);
    for(int i=0;i<m;i++){
        if(rem[i]){
            if(!uf.same(u[i],v[i])){
                uf.merge(u[i],v[i]);
            }
        }
    }
    vector<long long> ans(q,(long long)n*(n-1)/2);
    for(auto i:uf.groups()){
        ans[q-1]-=(long long)(i.size())*(i.size()-1)/2;
    }
    for(int i=q-1;i;i--){
        ans[i-1]=ans[i];
        if(!uf.same(u[b[i]],v[b[i]])){
            long long g1=uf.size(u[b[i]]),g2=uf.size(v[b[i]]);
            ans[i-1]+=g1*(g1-1)/2+g2*(g2-1)/2-(g1+g2)*(g1+g2-1)/2;
            uf.merge(u[b[i]],v[b[i]]);
        }
    }
    for(auto i:ans)cout<<i<<"\n";
}