#include <bits/stdc++.h>
using namespace std;

#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y

#define ASSERT(expr...) assert((expr))

using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;

using f32 = float;
using f64 = double;
// }}}

constexpr i64 INF = 1'010'000'000'000'000'017LL;

constexpr i64 MOD = 998244353LL;

constexpr f64 EPS = 1e-12;

constexpr f64 PI = 3.14159265358979323846;

#define M5 100007
#define M9 1000000000

#define F first
#define S second

// util {{{
#define FOR(i, start, end) for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)

#define all(x) (x).begin(), (x).end()
#define ll long long int
#define VI vector<ll>
#define VVI vector<VI>

#define ISD true
#define debug(x) \
    if (ISD)     \
    cout << #x << ": " << x << endl

template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {})
{
    if (comp(xmax, x))
    {
        xmax = x;
        return true;
    }
    return false;
}

template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {})
{
    if (comp(x, xmin))
    {
        xmin = x;
        return true;
    }
    return false;
}

/* UnionFind：素集合系管理の構造体(union by size)
    isSame(x, y): x と y が同じ集合にいるか。 計算量はならし O(α(n))
    unite(x, y): x と y を同じ集合にする。計算量はならし O(α(n))
    treeSize(x): x を含む集合の要素数。
*/
struct UnionFind
{
    vector<int> size, parents;
    UnionFind() {}
    UnionFind(int n)
    { // make n trees.
        size.resize(n, 0);
        parents.resize(n, 0);
        for (int i = 0; i < n; i++)
        {
            makeTree(i);
        }
    }
    void makeTree(int x)
    {
        parents[x] = x; // the parent of x is x
        size[x] = 1;
    }
    bool isSame(int x, int y) { return findRoot(x) == findRoot(y); }
    bool unite(int x, int y)
    {
        x = findRoot(x);
        y = findRoot(y);
        if (x == y)
            return false;
        if (size[x] > size[y])
        {
            parents[y] = x;
            size[x] += size[y];
        }
        else
        {
            parents[x] = y;
            size[y] += size[x];
        }
        return true;
    }
    int findRoot(int x)
    {
        if (x != parents[x])
        {
            parents[x] = findRoot(parents[x]);
        }
        return parents[x];
    }
    int treeSize(int x) { return size[findRoot(x)]; }
};

int main()
{
    ll N, M;
    cin >> N >> M;
    using P = pair<ll, ll>;
    vector<P> UV(M);
    REP(i, M)
    {
        cin >> UV[i].first >> UV[i].second;
        UV[i].first--;
        UV[i].second--;
    }
    ll Q;
    cin >> Q;

    VI B(M, INF);
    REP(i, Q)
    {
        ll b;
        cin >> b;
        B[b - 1] = i;
    }

    VI v(M);
    REP(i, M)
    v[i] = i;
    auto comp = [&](int a, int b)
    {
        return B[a] > B[b];
    };
    sort(all(v), comp);

    UnionFind uf(N);
    int ind = 0;
    ll sum = 0;
    while (ind < M && B[v[ind]] == INF)
    {
        if (uf.isSame(UV[v[ind]].first, UV[v[ind]].second))
        {
            ind++;
            continue;
        }
        sum += uf.treeSize(UV[v[ind]].first) * uf.treeSize(UV[v[ind]].second);
        uf.unite(UV[v[ind]].first, UV[v[ind]].second);
        ind++;
    }
    VI ans;
    ll ALL = N * (N - 1) / 2;
    ans.push_back(ALL - sum);
    while (ind < M - 1)
    {
        if (uf.isSame(UV[v[ind]].first, UV[v[ind]].second))
        {
            ind++;
            ans.push_back(ans.back());
            continue;
        }
        sum += uf.treeSize(UV[v[ind]].first) * uf.treeSize(UV[v[ind]].second);
        uf.unite(UV[v[ind]].first, UV[v[ind]].second);
        ans.push_back(ALL - sum);
        ind++;
    }
    reverse(all(ans));
    for (auto a : ans)
    {
        cout << a << endl;
    }
    return 0;
}