#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e15;
const int N = 300010;
int n, m, sz[N], fg[N], hd[N], a[N], b[N], cnt, o, lg[N], bin[25];
ll dis[N], f[N][21];
stack<int> s;
struct Edge {
  int v, nt, w;
} E[N << 1];
char gc() {
  static char *p1, *p2, s[1000000];
  if (p1 == p2) p2 = (p1 = s) + fread(s, 1, 1000000, stdin);
  return (p1 == p2) ? EOF : *p1++;
}
int rd() {
  int x = 0;
  char c = gc();
  while (c < '0' || c > '9') c = gc();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = gc();
  return x;
}
void adde(int u, int v, int w) {
  E[o] = (Edge){v, hd[u], w};
  hd[u] = o++;
}
void adde2(int u, int v, int w) {
  adde(u, v, w);
  adde(v, u, w);
}
bool dfs(int u, int fa) {
  sz[u] = 1;
  for (int i = hd[u]; i; i = E[i].nt) {
    int v = E[i].v, w = E[i].w;
    if (v == fa) continue;
    dis[v] = dis[u] + w;
    if (dfs(v, u)) return true;
    fg[u] |= fg[v];
    if (!fg[v]) sz[u] += sz[v], b[u] = w;
  }
  fg[u] |= (u == n);
  if (fg[u]) s.push(u);
  if (fg[u] && sz[u] > 2) return true;
  return false;
}
ll query(int x, int y) {
  if (x > y) return -inf;
  int k = lg[y - x + 1];
  return max(f[x][k], f[y - bin[k] + 1][k]);
}
int main() {
  n = rd();
  m = rd();
  o = 1;
  for (int i = 1, u, v, w; i < n; i++) {
    u = rd(), v = rd(), w = rd();
    adde2(u, v, w);
  }
  if (dfs(1, 0)) {
    for (int i = 1, x; i <= m; i++) {
      x = rd();
      printf("%I64d\n", dis[n]);
    }
    return 0;
  }
  while (!s.empty()) {
    a[++cnt] = s.top();
    s.pop();
  }
  for (int i = 1; i <= cnt; i++) f[i][0] = dis[a[i]] + b[a[i]];
  for (int i = 2; i <= cnt; i++) lg[i] = lg[i >> 1] + 1;
  for (int i = bin[0] = 1; i <= 20; i++) bin[i] = bin[i - 1] << 1;
  for (int i = 1; i <= 20; i++)
    for (int j = 1; j <= cnt; j++) {
      if (bin[i] + j - 1 > cnt) break;
      f[j][i] = max(f[j][i - 1], f[j + bin[i - 1]][i - 1]);
    }
  ll mx = -inf;
  for (int i = 2; i <= cnt; i++) {
    mx = max(mx, b[a[i]] - dis[a[i]] +
                     query(1, i - 1 - (sz[a[i]] == 1 && sz[a[i - 1]] == 1)));
  }
  mx += dis[n];
  for (int i = 1, x; i <= m; i++) {
    x = rd();
    printf("%I64d\n", min(mx + x, dis[n]));
  }
  return 0;
}
