#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
struct UnionFind{
    int cnt;
    vector<int> par, siz;
    UnionFind(int N) : par(N), siz(N,1){
        rep(i,N) par[i] = i;
        cnt = N;
    }
    int root(int x){
        if(par[x]==x) return x;
        return par[x] = root(par[x]);
    }
    bool unite(int x,int y){
        x = root(x); y = root(y);
        if(x==y) return false;
        --cnt;
        if(siz[x]<siz[y]) swap(x,y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x){
        return siz[root(x)];
    }
    bool same(int x,int y){
        return root(x) == root(y);
    }
};
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m,k;
    cin >> n >> m;
    ll tot = (ll)n*(n-1)/2;
    vector<int> u(m), v(m);
    rep(i,m) cin >> u[i] >> v[i], --u[i], --v[i];
    cin >> k;
    vector<int> b(k);
    vector<bool> ok(m,true);
    UnionFind uf(n);
    rep(i,k) cin >> b[i], ok[--b[i]] = false;
    rep(i,m)if(ok[i] && !uf.same(u[i], v[i])){
        tot -= (ll)uf.size(u[i]) * uf.size(v[i]);
        uf.unite(u[i], v[i]);
    }
    vector<ll> ans(k);
    for(int i=k-1;i>=0;--i){
        ans[i] = tot;
        if(!uf.same(u[b[i]], v[b[i]])){
            tot -= (ll)uf.size(u[b[i]]) * uf.size(v[b[i]]);
            uf.unite(u[b[i]], v[b[i]]);
        }
    }
    rep(i,k) cout << ans[i] << '\n';
    return 0;
}