#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;

struct Tree
{
    int n;
    int r;
    int l;
    std::vector<std::vector<int>> prit;
    std::vector<std::vector<int>> t;
    std::vector<int> par;
    std::vector<int> dpt;
    std::vector<int> tour;
    std::vector<std::vector<int>> appear_on_tour;
    std::vector<std::vector<int>> anc;
    
    Tree(){}
    
    Tree(int n) : n(n){
        prit.resize(n);
        t.resize(n);
        par.resize(n);
        dpt.resize(n);
    }
    
    void add_edge(int u, int v){
        prit[u].push_back(v);
        prit[v].push_back(u);
    }
    
    void build(int r_){
        r = r_;
        for(int i = 0; i < n; i++) dpt[i] = -1;
        std::queue<int> que;
        par[r] = -1;
        dpt[r] = 0;
        que.push(r);
        while(que.size()){
            int u = que.front();
            que.pop();
            for(int v : prit[u]){
                if(dpt[v] == -1){
                    t[u].push_back(v);
                    par[v] = u;
                    dpt[v] = dpt[u] + 1;
                    que.push(v);
                }
            }
        }
    }
    
    void rebuild(int r_){
        for(int u = 0; u < n; u++) t[u].clear();
        build(r_);
    }
    
    std::vector<int> toposort(){
        std::vector<std::pair<int, int>> p(n);
        for(int i = 0; i < n; i++) p[i] = std::pair<int, int>(dpt[i], i);
        sort(p.begin(), p.end(), std::greater<std::pair<int, int>>());
        std::vector<int> res(n);
        for(int i = 0; i < n; i++) res[i] = p[i].second;
        return res;
    }
    
    void dfs(int u, int &k){
        appear_on_tour[u].push_back(k);
        tour[k++] = u;
        for(int v : t[u]){
            dfs(v, k);
            appear_on_tour[u].push_back(k);
            tour[k++] = u;
        }
    }
    
    void build_euler_tour(){
        tour.resize(n * 2 - 1);
        appear_on_tour.resize(n);
        int k = 0;
        dfs(r, k);
    }
    
    void build_lca(){
        for(l = 1; l <= n; l++){
            if((1 << (l - 1)) >= n) break;
        }
        anc.resize(l);
        for(int j = 0; j < l; j++) anc[j].resize(n);
        for(int i = 0; i < n; i++) anc[0][i] = par[i];
        for(int j = 1; j < l; j++){
            for(int i = 0; i < n; i++){
                if(anc[j - 1][i] == -1) anc[j][i] = -1;
                else anc[j][i] = anc[j - 1][anc[j - 1][i]];
            }
        }
    }
    
    int lca(int u, int v){
        if(dpt[u] < dpt[v]) std::swap(u, v);
        int dpt_diff = dpt[u] - dpt[v];
        for(int j = l - 1; j >= 0; j--){
            if((dpt_diff >> j) & 1) u = anc[j][u];
        }
        if(u == v) return u;
        for(int j = l - 1; j >= 0; j--){
            if(anc[j][u] != anc[j][v]){
                u = anc[j][u];
                v = anc[j][v];
            }
        }
        return anc[0][u];
    }
};

int main()
{
    int n, k;
    cin >> n >> k;
    Tree t(n);
    for(int i = 0; i < n - 1; i++){
        int u, v;
        cin >> u >> v;
        u--; v--;
        t.add_edge(u, v);
    }
    t.build(0);
    t.build_euler_tour();
    int d[100005];
    bool b[100005]{0};
    for(int i = 0; i < k; i++){
        cin >> d[i];
        d[i]--;
        b[d[i]] = true;
    }
    int lastu = 0, lasti = 0;
    int l = 0;
    for(int i = 0; i < (int)t.tour.size(); i++){
        int u = t.tour[i];
        if(b[u] || u == 0){
            if(u != lastu) l += i - lasti;
            lastu = u;
            lasti = i;
        }
    }
    vector<int> p = t.toposort();
    int s[100005]{0};
    int dp0[100005];
    for(int u = 0; u < n; u++) dp0[u] = -10000000;
    for(int u : p){
        if(b[u]){
            dp0[u] = 0;
            s[u] = 1;
        }
        for(int v : t.t[u]){
            dp0[u] = max(dp0[u], dp0[v] + 1);
            s[u] += s[v];
        }
    }
    reverse(p.begin(), p.end());
    int dp1[100005];
    for(int u = 0; u < n; u++) dp1[u] = -10000000;
    for(int u : p){
        int k = t.t[u].size();
        vector<int> l, r;
        l.assign(k + 1, -10000000);
        r.assign(k + 1, -10000000);
        for(int i = 1; i <= k; i++){
            int v = t.t[u][i - 1];
            l[i] = max(l[i - 1], dp0[v] + 1);
        }
        for(int i = k - 1; i >= 0; i--){
            int v = t.t[u][i];
            r[i] = max(r[i + 1], dp0[v] + 1);
        }
        for(int i = 0; i < k; i++){
            int v = t.t[u][i];
            dp1[v] = max(dp1[v], max(dp1[u], max(l[i], r[i + 1])) + 1);
            if(b[u]) dp1[v] = max(dp1[v], 1);
        }
    }
    int dp[100005];
    for(int u = 0; u < n; u++) dp[u] = max(dp0[u], dp1[u]);
    int ans[100005];
    ans[0] = l - dp[0];
    for(int i = 1; i < (int)t.tour.size(); i++){
        int u = t.tour[i];
        int v = t.tour[i - 1];
        if((s[u] == 0 && t.dpt[u] > t.dpt[v]) || (s[u] - b[u] == n && t.dpt[u] < t.dpt[v])) l += 2;
        if((s[v] == 0 && t.dpt[u] < t.dpt[v]) || (s[v] - b[v] == n && t.dpt[u] > t.dpt[v])) l -= 2;
        ans[u] = l - dp[u];
    }
    for(int u = 0; u < n; u++) cout << ans[u] << endl;
}