using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => int.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var map = NArr(m);
        var q = NN;
        var b = LList(q);
        var bset = new HashSet<int>(b);

        var uf = new UnionFindTree(n);
        var first = (long)n * (n - 1) / 2;
        for (var i = 0; i < m; ++i)
        {
            if (bset.Contains(i + 1)) continue;
            var u = map[i][0] - 1;
            var v = map[i][1] - 1;
            if (!uf.IsSameTree(u, v))
            {
                first -= (long)uf.GetSize(u) * uf.GetSize(v);
                uf.Unite(u, v);
            }
        }
        var ans = new List<long>(q) { first };
        for (var i = q - 1; i >= 0; --i)
        {
            var u = map[b[i] - 1][0] - 1;
            var v = map[b[i] - 1][1] - 1;
            var add = 0L;
            if (!uf.IsSameTree(u, v))
            {
                add = (long)uf.GetSize(u) * uf.GetSize(v);
                uf.Unite(u, v);
            }
            ans.Add(ans[^1] - add);
        }
        ans.Reverse();
        WriteLine(string.Join("\n", ans.Skip(1)));
    }
    class UnionFindTree
    {
        int[] roots;
        public UnionFindTree(int size)
        {
            roots = new int[size];
            for (var i = 0; i < size; ++i) roots[i] = -1;
        }
        public int GetRoot(int a)
        {
            if (roots[a] < 0) return a;
            return roots[a] = GetRoot(roots[a]);
        }
        public bool IsSameTree(int a, int b)
        {
            return GetRoot(a) == GetRoot(b);
        }
        public bool Unite(int a, int b)
        {
            var x = GetRoot(a);
            var y = GetRoot(b);
            if (x == y) return false;
            if (-roots[x] < -roots[y]) { var tmp = x; x = y; y = tmp; }
            roots[x] += roots[y];
            roots[y] = x;
            return true;
        }
        public int GetSize(int a)
        {
            return -roots[GetRoot(a)];
        }
    }
}