#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ll = long long int;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;
const double eps = 1e-7;
bool feq(double x, double y) { return abs(x - y) <= eps; }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vll xs, ll t) {
  for (const auto &x : xs)
    if (!(x >= 0 && x < t)) return false;
  return true;
}
int ceillog2(ll x) { return int(ceil(log2(x))); }
int floorlog2(ll x) { return int(floor(log2(x))); }
template <class T>
T reversed(T container) {
  reverse(container.begin(), container.end());
  return container;
}
template <class T>
void printv(const vector<T> &v) {
  for (const T &x : v) cout << x << " ";
  cout << endl;
}
template <class T>
void printmx(const vector<vector<T>> &mx) {
  for (const vector<T> &v : mx) printv(v);
}
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) {
  ll m = (ll)sqrt((double)x);
  return m + (m * m <= x ? 0 : -1);
}
ll ceilsqrt(ll x) {
  ll m = (ll)sqrt((double)x);
  return m + (x <= m * m ? 0 : 1);
}
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) {
  if (n == 0)
    return m;
  else
    return gcd(n, m % n);
}
ll lcm(ll m, ll n) { return m * n / gcd(m, n); }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ;
  int n, m;
  cin >> n >> m;
  vvi lst(n);
  vector<size_t> d(n);
  for (int i = 0; i < int(m); i++) {
    int s, t;
    cin >> s >> t;
    s--;
    t--;
    if (s > t) swap(s, t);
    lst[s].push_back(t);
    d[s]++;
    d[t]++;
  }
  ll sum = 0;
  for (int i = 0; i < int(n); i++) {
    sum += ll(lst[i].size()) * (d[i] - lst[i].size());
  }
  cout << sum << endl;
  int q;
  cin >> q;
  for (int _ = 0; _ < int(q); _++) {
    int x;
    cin >> x;
    x--;
    for (const auto &y : lst[x]) {
      ll bef = ll(lst[y].size()) * (d[y] - lst[y].size());
      lst[y].push_back(x);
      ll aft = ll(lst[y].size()) * (d[y] - lst[y].size());
      sum += aft - bef;
    }
    sum -= ll(lst[x].size()) * (d[x] - lst[x].size());
    lst[x].clear();
    cout << sum << endl;
  }
}
