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

        var tree = new List<int>[n];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(edge[1]);
            tree[edge[1]].Add(edge[0]);
        }

        var g = new bool[n];
        foreach (var vi in v) g[vi] = true;
        var nx = new int[n];
        for (var i = 0; i < n; ++i)
        {
            foreach (var next in tree[i]) if (g[next]) ++nx[i];
        }

        var olist = (bool[]) g.Clone();
        for (var i = 0; i < n; ++i) if (g[i]) foreach (var next in tree[i]) olist[next] = true;
        var org = olist.Count(f => f);

        var rem = new int[n];
        for (var i = 0; i < n; ++i)
        {
            foreach (var n2 in tree[i])
            {
                if (!g[n2] && g[i] && nx[n2] == 1) ++rem[i];
            }
        }
        var ans = Enumerable.Repeat(org, n).ToArray();
        for (var i = 0; i < n; ++i)
        {
            if (g[i] || nx[i] > 0) --ans[i];
            foreach (var n1 in tree[i])
            {
                if ((g[n1] || nx[n1] > 0) && nx[n1] == (g[i] ? 1 : 0)) --ans[i];
                ans[i] -= rem[n1];
                if (!g[i] && g[n1] && nx[i] == 1) ++ans[i];
            }
        }
        WriteLine(string.Join("\n", ans));
    }
}