import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int[] A, B;
long[] C;

int[][] G;
long C0;

/*
  must use > d
  cannot use < C0 - d
*/
long check(long d) {
  auto must = new bool[N - 1];
  auto del = new bool[N - 1];
  foreach (i; 0 .. N - 1) {
    must[i] = (C[i] > d);
    if (C[i] < C0 - d) {
      if (must[i]) {
        return false;
      }
      del[i] = true;
    }
  }
  debug {
    writeln("d = ", d);
    writeln("  must = ", must);
    writeln("  del = ", del);
  }
  
  auto deg = new int[N];
  foreach (i; 0 .. N - 1) if (!del[i]) {
    ++deg[A[i]];
    ++deg[B[i]];
  }
  DList!int que;
  foreach (u; 0 .. N) if (deg[u] == 1) {
    que ~= u;
  }
  for (; !que.empty; ) {
    const u = que.front;
    que.removeFront;
    foreach (i; G[u]) if (!must[i] && !del[i]) {
      const v = A[i] ^ B[i] ^ u;
      debug {
        writeln("  delete ", u, " ", v);
      }
      del[i] = true;
      --deg[u];
      --deg[v];
      if (deg[v] == 1) {
        que ~= v;
      }
    }
  }
  const ok = (deg.count(1) <= 2);
  return ok;
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      A.length = N - 1;
      B.length = N - 1;
      C.length = N - 1;
      foreach (i; 0 .. N - 1) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
        C[i] = readLong;
      }
      
      G = new int[][N];
      foreach (i; 0 .. N - 1) {
        G[A[i]] ~= i;
        G[B[i]] ~= i;
      }
      
      C0 = C.maxElement;
      long lo = -1, hi = C0;
      for (; lo + 1 < hi; ) {
        const mid = (lo + hi) / 2;
        (check(mid) ? hi : lo) = mid;
      }
      writeln(hi);
    }
  } catch (EOFException e) {
  }
}