#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
#endif

#if !defined(_WIN32) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define _loop_i_t(j, k) make_signed_t<decltype((j) - (k))>
#define For(i, j, k) for (_loop_i_t(j, k) i = (j); i <= (k); ++i) // NOLINT
#define ForDown(i, j, k)                                                       \
  for (_loop_i_t(j, k) i = (j); i >= decltype(i)(k); --i) // NOLINT
#define eb emplace_back
#ifndef ONLINE_JUDGE
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)
#else
#define FileIO(filename) void(0)
#endif

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
CONSTEXPR_FUNC il ll qpow(ll x, ull y, ll mod){ ll ans = 1; x %= mod; while (y) { if (y & 1) (ans *= x) %= mod; (x *= x) %= mod; y >>= 1; } return ans; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y); }
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); } x *= f; }
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x), read(y...); }
// clang-format on

// File head end

namespace {
constexpr ll MAXN = 2e5 + 5, INF = ll(1e18) + 5;
[[gnu::always_inline]] inline ll &_sat_add(ll &x, ll y) {
  return x += y, cmax(x, -INF), x;
}
struct Info {
  int len;
  vector<ll> val[2][2];
  Info() : len(0), val() {}
  Info(int _len) : len(_len) {
    assert(_len > 0);
    For(i, 0, 1) For(j, 0, 1) val[i][j] = vector<ll>(_len, -ll(1e18) - 5),
                              val[i][j][0] = 0;
  }
  static vector<ll> add(const vector<ll> &x, const vector<ll> &y) {
    int n1 = x.size(), n2 = y.size();
    ll wi;
    vector<ll> res;
    res.reserve(n1 + n2 - 1), res.eb(wi = x[0] + y[0]);
    for (int i = 1, j = 1; i < n1 || j < n2;) {
      if (j == n2 || (i < n1 && x[i] - x[i - 1] >= y[j] - y[j - 1]))
        res.eb(_sat_add(wi, x[i] - x[i - 1])), i++;
      else
        res.eb(_sat_add(wi, y[j] - y[j - 1])), j++;
    }
    return res;
  }
  Info operator+(const Info &rhs) const {
    Info res(len + rhs.len - 1);
    For(i, 0, 1) For(j, 0, 1) For(p, 0, 1) For(q, 0, 1) {
      if (!j && !p)
        continue;
      auto tmp = add(val[i][j], rhs.val[p][q]);
      assert(tmp.size() == res.len);
      assert(res.val[i][q].size() == res.len);
      for (int o = 0; o < res.len; o++)
        cmax(res.val[i][q][o], tmp[o]);
    }
    return res;
  }
} val[MAXN];

int n, wi[MAXN], fa[MAXN], sz[MAXN], hson[MAXN];
vector<pii> T[MAXN];

void dfs1(int x) {
  sz[x] = 1;
  for (auto [v, w] : T[x])
    if (v != fa[x]) {
      wi[v] = w, fa[v] = x, dfs1(v), sz[x] += sz[v];
      if (sz[v] > sz[hson[x]])
        hson[x] = v;
    }
}

void dfs2(int x) {
  vector<int> cur;
  for (int y = x; y; y = hson[y]) {
    // cerr << y << '\n';
    cur.eb(y);
    val[y] = {1};
    priority_queue<tuple<int, int, vector<ll>, vector<ll>>> pq;
    for (auto [v, _] : T[y])
      if (v != fa[y] && v != hson[y]) {
        dfs2(v);
        vector<ll> qwq(val[v].len), ovo(val[v].len);
        For(i, 1, val[v].len - 1) {
          qwq[i] = max(val[v].val[1][0][i], val[v].val[1][1][i]);
          ovo[i] = max({val[v].val[0][0][i], val[v].val[0][1][i], qwq[i]});
        }
        pq.emplace(-val[v].len, v, qwq, ovo);
      }
    while (pq.size() > 1) {
      auto [_1, _2, v1, v2] = pq.top();
      pq.pop();
      auto [_3, _4, v3, v4] = pq.top();
      pq.pop();
      auto v5 = Info::add(v1, v3), v6 = Info::add(v1, v4),
           v7 = Info::add(v2, v3);
      for (int i = 0; i < v6.size(); i++)
        cmax(v6[i], max(v5[i], v7[i]));
      pq.emplace(-int(v6.size()), _2, v5, v6);
    }
    if (!pq.empty())
      val[y].val[1][1] = get<2>(pq.top()), val[y].val[1][0] = get<3>(pq.top());
    val[y].val[0][1] = val[y].val[1][1];
    val[y].val[0][0] = Info::add(val[y].val[1][1], {0, wi[y]});
    val[y].len = val[y].val[0][0].size();
    For(i, 0, 1) For(j, 0, 1) val[y].val[i][j].resize(val[y].len,
                                                      -ll(1e18) - 5);
    for (int i = 0; i < val[y].len; i++)
      cmax(val[y].val[0][0], val[y].val[1][1]);
    // cerr << y << '\n';
    // For(_, 1, val[y].len) {
    //   cerr << _ << " | ";
    //   For(i, 0, 1) For(j, 0, 1) cerr << val[y].val[i][j][_] << ' ';
    //   cerr << '\n';
    // }
  }
  auto calc = [&](auto &&self, int l, int r) -> void {
    if (r == l + 1)
      return;
    int mid = (l + r) >> 1;
    self(self, l, mid), self(self, mid, r);
    // auto tmp = val[cur[l]];
    val[cur[l]] = val[cur[l]] + val[cur[mid]];
    // cerr << cur[l] << ' ' << cur[r - 1] << '\n';
  };
  calc(calc, 0, cur.size());
}

il void Main() {
  read(n);
  For(i, 1, n - 1) {
    int u, v, w;
    read(u, v, w);
    T[u].eb(v, w), T[v].eb(u, w);
  }
  dfs1(1);
  dfs2(1);
  For(i, 1, n - 1) {
    if (i >= val[1].len)
      cout << "? ";
    else {
      ll v = max(val[1].val[1][0][i], val[1].val[1][1][i]);
      if (v <= -2e15)
        cout << "? ";
      else
        cout << v << ' ';
    }
  }
}
} // namespace

signed main() { return Main(), 0; }