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

using ll =long long;

#include<atcoder/dsu>
using namespace atcoder;

void solve(){
    ll N,M;
    cin>>N>>M;
    vector<ll> E(M,1e18);
    vector<array<ll,2>> D(M);
    for(int i=0;i<M;i++){
        ll u,v;
        cin>>u>>v;
        D[i]={u-1,v-1};
    }
    ll Q;
    cin>>Q;
    vector<ll> H(Q);
    for(int q=0;q<Q;q++){
        cin>>H[q];
        H[q]--;
        E[H[q]]=q;
    }
    dsu d(N);
    ll mg=0;
    for(int i=0;i<M;i++){
        if(E[i]>1e17){
            auto [u,v]=D[i];
            if(d.same(u,v))continue;
            mg+=ll(d.size(u))*ll(d.size(v));
            d.merge(u,v);
        }
    }
    vector<ll> AN(Q);
    for(int q=Q-1;q>=0;q--){
        AN[q]=N*(N-1)/2-mg;
        auto [u,v]=D[H[q]];
        if(d.same(u,v))continue;
        mg+=ll(d.size(u))*ll(d.size(v));
        d.merge(u,v);
    }
    for(int q=0;q<Q;q++){
        cout<<AN[q]<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T=1;
    // cin>>T;
    while(T--)solve();
}