#include <bits/stdc++.h>
#include <atcoder/all>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using Bint = mp::cpp_int;
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> u(m), v(m);
    rep(i,m) cin >> u[i] >> v[i];
    rep(i,m) {
        --u[i];
        --v[i];
    }
    int q;
    cin >> q;
    vector<int> b(q);
    set<int> st;
    rep(i,q) {
        cin >> b[i];
        --b[i];
        st.insert(b[i]);
    }
    dsu uf(n);
    ll sum = (ll)n*(n-1)/2;
    rep(i,m) {
        if(!st.count(i)) {
            sum -= (ll)uf.size(u[i])*uf.size(v[i]);
            uf.merge(u[i],v[i]);
        }
    }
    vector<int> ans(q);
    for(int i=q-1;i>=0;i--) {
        ans[i] = sum;
        if(uf.same(u[b[i]], v[b[i]])) continue;
        sum -= (ll)uf.size(u[b[i]])*uf.size(v[b[i]]);
        uf.merge(u[b[i]], v[b[i]]);
    }
    rep(i,q) {
        cout<<ans[i]<<endl;
    }
    return 0;
}