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

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[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    static long[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => long.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var map = NMap(n - 1);
        var query = NMap(m);

        var tree = new HashSet<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new HashSet<int>();
        for (var i = 0; i < m; ++i)
        {
            tree[query[i][0]].Add(i);
            tree[query[i][1]].Add(i);
        }
        var uf = new UnionFindTree(n);
        var ans = new int[n - 1];
        var tmp = 0;
        for (var i = n - 2; i >= 0; --i)
        {
            ans[i] = tmp;
            var pr1 = uf.GetRoot(map[i][0]);
            var pr2 = uf.GetRoot(map[i][1]);
            uf.Unite(pr1, pr2);
            var ns = tree[pr1].Count > tree[pr2].Count ? tree[pr1] : tree[pr2];
            var os = tree[pr1].Count > tree[pr2].Count ? tree[pr2] : tree[pr1];
            foreach (var s in os)
            {
                if (ns.Contains(s))
                {
                    ++tmp;
                    ns.Remove(s);
                }
                else ns.Add(s);
            }
            var nr = uf.GetRoot(pr1);
            tree[nr] = ns;
        }
        WriteLine(string.Join("\n", ans));
    }
    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)];
        }
    }
}