/* -*- coding: utf-8 -*-
 *
 * 3200.cc:  No.3200 Sinking Islands - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_M = 200000;

/* typedef */

using ll = long long;
using pii = pair<int,int>;

struct UFT {
  vector<int> links, ranks, sizes;
  UFT() {}

  void init(int n) {
    links.resize(n);
    for (int i = 0; i < n; i++) links[i] = i;
    ranks.assign(n, 1);
    sizes.assign(n, 1);
  }

  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }

  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }

  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};

/* global variables */

pii es[MAX_M];
int bs[MAX_M];
bool used[MAX_M];
UFT uft;
ll res[MAX_M];

/* subroutines */

inline ll nc2(int n) { return (ll)n * (n - 1) / 2; }

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    es[i] = {u, v};
  }

  int qn;
  scanf("%d", &qn);
  for (int i = 0; i < qn; i++)
    scanf("%d", bs + i), bs[i]--, used[bs[i]] = true;

  uft.init(n);
  for (int i = 0; i < m; i++)
    if (! used[i]) uft.merge(es[i].first, es[i].second);

  ll sum = 0;
  for (int u = 0; u < n; u++)
    if (uft.root(u) == u) {
      //printf(" size(%d)=%d\n", u, uft.size(u));
      sum += nc2(uft.size(u));
    }
  //printf(" sum=%lld\n", sum);

  for (int i = qn - 1; i >= 0; i--) {
    res[i] = nc2(n) - sum;

    auto [u, v] = es[bs[i]];
    if (! uft.same(u, v)) {
      int usz = uft.size(u), vsz = uft.size(v);
      sum += nc2(usz + vsz) - (nc2(usz) + nc2(vsz));
      uft.merge(u, v);
    }
  }

  for (int i = 0; i < qn; i++) printf("%lld\n", res[i]);
  
  return 0;
}