#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
string direc = "URDL";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int ot[100035];
vector<int> in[100035];
long long ans = 0;
void add(int i, int fg) { ans += (long long)in[i].size() * ot[i] * fg; }
void fmain(int tid) {
  scanf("%d%d", &n, &m);
  for (int(i) = 1; (i) <= (int)(m); (i)++) {
    int x, y;
    scanf("%d%d", &x, &y);
    if (x < y) swap(x, y);
    ot[x]++;
    in[y].push_back(x);
  }
  for (int(i) = 1; (i) <= (int)(n); (i)++)
    ans += (long long)in[i].size() * ot[i];
  printf("%lld\n", ans);
  int Q;
  scanf("%d", &Q);
  for (int(i) = 1; (i) <= (int)(Q); (i)++) {
    int v;
    scanf("%d", &v);
    add(v, -1);
    for (int z : in[v]) add(z, -1);
    for (int z : in[v]) {
      ot[z]--;
      in[z].push_back(v);
      add(z, 1);
    }
    ot[v] += in[v].size();
    in[v].clear();
    printf("%lld\n", ans);
  }
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
