#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
template <class S, class T>
ostream& operator<<(ostream& os, const pair<S, T>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, const unordered_set<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class S, class T>
ostream& operator<<(ostream& os, const unordered_map<S, T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, const multiset<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class S, class T>
ostream& operator<<(ostream& os, const map<S, T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
void dbs(string str, T t) {
  cerr << str << " : " << t << "\n";
}
template <class T, class... S>
void dbs(string str, T t, S... s) {
  long long idx = str.find(',');
  cerr << str.substr(0, idx) << " : " << t << ",";
  dbs(str.substr(idx + 1), s...);
}
template <class T>
void prc(T a, T b) {
  cerr << "[";
  for (T i = a; i != b; ++i) {
    if (i != a) cerr << ", ";
    cerr << *i;
  }
  cerr << "]\n";
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y / 2, x = (x * x) % 1000000007;
  }
  return res % 1000000007;
}
long long dis[300001][2];
vector<vector<pair<long long, long long> > > arr(300001);
vector<pair<long long, long long> > temp;
vector<long long> val;
long long seg[4 * 300001];
void cons(long long low, long long high, long long index) {
  if (low == high) {
    seg[index] = dis[temp[low].second][1];
    return;
  }
  long long mid = (low + high) / 2;
  cons(low, mid, 2 * index);
  cons(mid + 1, high, 2 * index + 1);
  seg[index] = max(seg[2 * index], seg[2 * index + 1]);
}
void update(long long low, long long high, long long index, long long val,
            long long pos) {
  if (low == high) {
    seg[index] = val;
    return;
  }
  long long mid = (low + high) / 2;
  if (mid >= pos)
    update(low, mid, 2 * index, val, pos);
  else
    update(mid + 1, high, 2 * index + 1, val, pos);
  seg[index] = max(seg[2 * index], seg[2 * index + 1]);
}
long long query(long long low, long long high, long long index, long long l,
                long long r) {
  if (low > r or high < l) return -1e18;
  if (low >= l and high <= r) return seg[index];
  long long mid = (low + high) / 2;
  return max(query(low, mid, 2 * index, l, r),
             query(mid + 1, high, 2 * index + 1, l, r));
}
void dfs(long long u, long long par, long long index) {
  for (auto v : arr[u]) {
    if (v.first != par)
      dis[v.first][index] += dis[u][index] + v.second, dfs(v.first, u, index);
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  long long i;
  for (i = 0; i < n - 1; i++) {
    long long u, v, w;
    cin >> u >> v >> w;
    arr[u].push_back(make_pair(v, w));
    arr[v].push_back(make_pair(u, w));
  }
  dfs(1, 0, 0);
  dfs(n, 0, 1);
  for (i = 0; i <= 4 * n; i++) seg[i] = -1e18;
  for (i = 1; i <= n; i++) {
    temp.push_back(make_pair(dis[i][0] - dis[i][1], i));
    val.push_back(dis[i][0] - dis[i][1]);
  }
  sort(temp.begin(), temp.end());
  sort(val.begin(), val.end());
  map<long long, long long> haha;
  for (i = 0; i < temp.size(); i++) haha[temp[i].second] = i;
  cons(0, n - 1, 1);
  long long ma = 0;
  for (i = 1; i <= n; i++) {
    for (auto v : arr[i]) {
      update(0, n - 1, 1, -1e18, haha[v.first]);
    }
    update(0, n - 1, 1, -1e18, haha[i]);
    long long x = lower_bound(val.begin(), val.end(), dis[i][0] - dis[i][1]) -
                  val.begin();
    ma = max(ma, dis[i][0] + query(0, n - 1, 1, x, n - 1));
    for (auto v : arr[i]) update(0, n - 1, 1, dis[v.first][1], haha[v.first]);
    update(0, n - 1, 1, dis[i][1], haha[i]);
  }
  for (i = 0; i < m; i++) {
    long long w;
    cin >> w;
    cout << min(dis[n][0], ma + w) << "\n";
  }
}
