#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) void(0)
#endif

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }

const int INF = (1 << 30) - 1;
const long long IINF = (1LL << 60) - 1;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 998244353;
// const int MOD = 1000000007;

#include <cassert>
#include <functional>
#include <vector>

template <class key_t, class sum_t = key_t> struct Rerooting {
    struct edge {
        int from, to;
        key_t cost;
        sum_t dp, ndp;
        edge(int from, int to, key_t cost, sum_t dp, sum_t ndp) : from(from), to(to), cost(cost), dp(dp), ndp(ndp) {}
    };
    using F = std::function<sum_t(sum_t, sum_t)>;
    using G = std::function<sum_t(sum_t, edge)>;

    int n;
    std::vector<std::vector<edge>> g;
    const F op;
    const G mapping;
    const sum_t id;

    Rerooting(int n, const F& op, const G& mapping, const sum_t& id)
        : n(n), g(n), op(op), mapping(mapping), id(id), sub(n, id), dp(n, id) {}

    void add_edge(int u, int v, key_t w) {
        assert(0 <= u and u < n);
        assert(0 <= v and v < n);
        g[u].emplace_back(u, v, w, id, id);
        g[v].emplace_back(v, u, w, id, id);
    }

    std::vector<sum_t> solve() {
        dfs_sub(0, -1);
        dfs_all(0, -1, id);
        return dp;
    }

private:
    std::vector<sum_t> sub, dp;

    void dfs_sub(int v, int p) {
        for (auto& e : g[v]) {
            if (e.to == p) continue;
            dfs_sub(e.to, v);
            e.dp = mapping(sub[e.to], e);
            sub[v] = op(sub[v], e.dp);
        }
    }

    void dfs_all(int v, int p, sum_t top) {
        sum_t cur = id;
        for (int i = 0; i < (int)g[v].size(); i++) {
            auto& e = g[v][i];
            e.ndp = cur;
            if (e.to == p) e.dp = mapping(top, e);
            cur = op(cur, e.dp);
        }
        dp[v] = cur;
        cur = id;
        for (int i = (int)g[v].size() - 1; i >= 0; i--) {
            auto& e = g[v][i];
            if (e.to != p) dfs_all(e.to, v, op(e.ndp, cur));
            cur = op(cur, e.dp);
        }
    }
};

struct S {
    int back, go;
    bool must;
    S(int back, int go, bool must) : back(back), go(go), must(must) {}
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, K;
    cin >> N >> K;
    vector<bool> D(N, false);
    auto op = [](S l, S r) { return S(l.back + r.back, min(l.go + r.back, l.back + r.go), l.must | r.must); };
    auto mapping = [&](S x, auto e) {
        bool must = x.must | D[e.to];
        return S(x.back + (must ? 2 : 0), x.go + (must ? 1 : 0), must);
    };
    Rerooting<int, S> G(N, op, mapping, S(0, 0, false));
    for (int i = 0; i < N - 1; i++) {
        int u, v;
        cin >> u >> v;
        G.add_edge(--u, --v, 1);
    }
    for (; K--;) {
        int d;
        cin >> d;
        D[--d] = true;
    }

    auto ans = G.solve();
    for (int i = 0; i < N; i++) cout << ans[i].go << '\n';
    return 0;
}