#include <bits/stdc++.h>
using namespace std;
const int N = 3 * 1e5 + 100;
long long f[N], d[2][N], pos[N];
vector<pair<long long, long long> > a[N];
set<pair<long long, long long> > st;
set<pair<long long, long long> >::iterator it;
long long n, m;
bool vis[N];
void dij(int s, int par, int vt) {
  for (int i = 0; i < a[s].size(); ++i) {
    if (a[s][i].first != par) {
      d[vt][a[s][i].first] = d[vt][s] + a[s][i].second;
      dij(a[s][i].first, s, vt);
    }
  }
}
bool cmp(int u, int v) { return f[u] < f[v]; }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  long long u, v, w;
  for (int i = 1; i < n; ++i) {
    cin >> u >> v >> w;
    a[u].push_back(pair<long long, long long>(v, w));
    a[v].push_back(pair<long long, long long>(u, w));
  }
  dij(1, 0, 0);
  dij(n, 0, 1);
  for (int i = 1; i <= n; ++i) {
    f[i] = d[0][i] - d[1][i];
    vis[i] = 0;
    pos[i] = i;
    st.insert(pair<long long, long long>(d[1][i], i));
  }
  long long res = 0;
  sort(pos + 1, pos + n + 1, cmp);
  for (int i = 1; i < n; ++i) {
    u = pos[i];
    vis[u] = 1;
    st.erase(pair<long long, long long>(d[1][u], u));
    for (int j = 0; j < a[u].size(); ++j) {
      if (!vis[a[u][j].first])
        st.erase(
            pair<long long, long long>(d[1][a[u][j].first], a[u][j].first));
    }
    if (st.size() != 0) {
      it = st.end();
      --it;
      res =
          max(res, min(d[0][u] + d[1][it->second], d[1][u] + d[0][it->second]));
    }
    for (int j = 0; j < a[u].size(); ++j) {
      if (!vis[a[u][j].first])
        st.insert(
            pair<long long, long long>(d[1][a[u][j].first], a[u][j].first));
    }
  }
  for (int i = 1; i <= m; ++i) {
    cin >> w;
    cout << min(d[0][n], res + w) << '\n';
  }
  return 0;
}
