#include <bits/stdc++.h>
using namespace std;
const int MAX_SIZE = 300010;
int n, m;
pair<int, int> p[MAX_SIZE];
bool block[MAX_SIZE];
vector<pair<int, int> > g[MAX_SIZE];
long long d[MAX_SIZE], mx[MAX_SIZE], sz[MAX_SIZE];
void dfs(int u, int par, int weight) {
  p[u] = make_pair(par, weight);
  for (auto v : g[u]) {
    if (v.first == par) continue;
    d[v.first] = d[u] + v.second;
    dfs(v.first, u, v.second);
  }
}
long long bst(int u, int par, long long dst) {
  long long res = dst;
  sz[u] = 1;
  for (int i = 0; i < g[u].size(); ++i) {
    pair<int, int> v = g[u][i];
    if (v.first == par || block[v.first]) continue;
    res = max(res, bst(v.first, u, dst + v.second));
    sz[u] += sz[v.first];
  }
  return res;
}
int main() {
  cin >> n >> m;
  for (int u, v, w, i = 0; i < n - 1; ++i) {
    scanf("%d%d%d", &u, &v, &w);
    g[u].push_back(make_pair(v, w));
    g[v].push_back(make_pair(u, w));
  }
  dfs(1, -1, 0);
  vector<pair<int, int> > path;
  int cur = n;
  while (1) {
    block[cur] = 1;
    path.push_back(make_pair(cur, p[cur].second));
    if (cur == 1) break;
    cur = p[cur].first;
  }
  reverse(path.begin(), path.end());
  for (int i = 1; i < path.size(); ++i) {
    path[i - 1].second = path[i].second;
  }
  path.back().second = 0;
  bool waste = false;
  for (int i = 0; i < path.size(); ++i) {
    mx[path[i].first] = bst(path[i].first, 0, 0);
    waste = waste || (sz[path[i].first] > 2);
  }
  long long sum = d[n];
  long long res =
      (path.size() > 2 || (mx[path[0].first] + mx[path.back().first] > 0))
          ? mx[path[0].first] + mx[path.back().first]
          : 0;
  for (int i = 0; i + 1 < path.size(); ++i) {
    if (mx[path[i].first] == 0 && mx[path[i + 1].first] == 0) continue;
    res = max(res,
              sum - path[i].second + mx[path[i].first] + mx[path[i + 1].first]);
  }
  for (int i = 0; i + 2 < path.size(); ++i) {
    res = max(res, sum - path[i].second - path[i + 1].second);
  }
  for (int i = 0; i < m; ++i) {
    long long x;
    scanf("%lld", &x);
    long long fn = min(d[n], res + x);
    if (waste) fn = max(fn, d[n]);
    printf("%lld\n", fn);
  }
  return 0;
}
