#include <bits/stdc++.h>
using namespace std;
const int N = 500010, M = N << 1;
#define int long long

int n, K;

// 链式前向星
int e[M], h[N], idx, w[M], ne[M];
void add(int a, int b, int c = 0) {
    e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
}

int pos[N];
int sz[N], g[N], f[N];
int len[N], id[N], slen[N];
void dfs1(int u, int fa) {
    if (pos[u]) sz[u] = 1;

    for (int i = h[u]; ~i; i = ne[i]) {
        int v = e[i];
        if (v == fa) continue;
        dfs1(v, u);
        if (sz[v]) {
            g[u] += g[v] + 2 * w[i];
            int now = len[v] + w[i];
            if (now >= len[u])
                slen[u] = len[u], len[u] = now, id[u] = v;
            else if (now > slen[u])
                slen[u] = now;
        }
        sz[u] += sz[v];
    }
}
void dfs2(int u, int fa) {
    for (int i = h[u]; ~i; i = ne[i]) {
        int v = e[i];
        if (v == fa) continue;
        if (!sz[v])
            f[v] = f[u] + 2 * w[i], len[v] = len[u] + w[i];
        else if (K - sz[v]) {
            f[v] = f[u];
            if (id[u] != v && len[v] < len[u] + w[i])
                slen[v] = len[v], len[v] = len[u] + w[i], id[v] = u;
            else if (len[v] < slen[u] + w[i])
                slen[v] = len[v], len[v] = slen[u] + w[i], id[v] = 1;
            else if (slen[v] < len[u] + w[i] && id[u] != v)
                slen[v] = len[u] + w[i];
            else if (slen[v] < slen[u] + w[i])
                slen[v] = slen[u] + w[i];
        } else
            f[v] = g[v];
        dfs2(v, u);
    }
}
signed main() {
    // 初始化链式前向星
    memset(h, -1, sizeof h);

    cin >> n >> K;
    for (int i = 1; i < n; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        add(a, b, c), add(b, a, c);
    }
    for (int i = 1; i <= K; i++) {
        int x;
        cin >> x;
        pos[x] = 1;
    }
    dfs1(1, 0);
    f[1] = g[1];

    dfs2(1, 0);
    for (int i = 1; i <= n; i++) cout << f[i] - len[i] << endl;
}