#include "atcoder/modint.hpp"
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint1000000007;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) {
      res = res * t % m;
    }
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

void _main() {
  i64 n, m;
  cin >> n >> m;
  vector<p2> edge(m);
  vector<bool> out(m, false);
  for (i64 i = 0; i < m; i++) {
    i64 u, v;
    cin >> u >> v;
    u--, v--;
    edge[i] = {u, v};
  }
  i64 q;
  cin >> q;
  vector<i64> query(q);
  for (i64 i = 0; i < q; i++) {
    i64 b;
    cin >> b;
    b--;
    query[i] = b;
    out[b] = true;
  }
  atcoder::dsu uf(n);
  vector<i64> cnt(n, 1);
  i64 now = 0;
  for (i64 i = 0; i < m; i++) {
    if (out[i]) continue;
    auto [u, v] = edge[i];
    if (uf.same(u, v)) continue;
    u = uf.leader(u), v = uf.leader(v);
    i64 a = cnt[u], b = cnt[v];
    cnt[u] = cnt[v] = 0;
    uf.merge(u, v);
    cnt[uf.leader(u)] = a + b;
    now += a * b;
  }
  vector<i64> ans(q, now);
  for (i64 i = q - 1; i >= 0; i--) {
    ans[i] = now;
    i64 id = query[i];
    auto [u, v] = edge[id];
    if (uf.same(u, v)) continue;
    u = uf.leader(u), v = uf.leader(v);
    i64 a = cnt[u], b = cnt[v];
    cnt[u] = cnt[v] = 0;
    uf.merge(u, v);
    cnt[uf.leader(u)] = a + b;
    now += a * b;
  }
  for (i64 i = 0; i < q; i++) cout << n * (n - 1) / 2 - ans[i] << "\n";
}