lychees/gist:5594878

## gistfile1.cpp
/** Micro Mezzo Macro Flation -- Overheated Economy ., Last Update: Jan. 28th 2013 **/ //{

/** Header .. **/ //{
#define LOCAL

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>

using namespace std;

#define REP(i, n) for (int i=0;i<int(n);++i)
#define FOR(i, a, b) for (int i=int(a);i<int(b);++i)
#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i)
#define REP_1(i, n) for (int i=1;i<=int(n);++i)
#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)
#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i)
#define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i)
#define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i)
#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i)
#define REP_N(i, n) for (i=0;i<int(n);++i)
#define FOR_N(i, a, b) for (i=int(a);i<int(b);++i)
#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i)
#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)
#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)
#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i)
#define REP_1_N(i, n) for (i=1;i<=int(n);++i)
#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)
#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i)
#define REP_C_N(i, n) for (int n____=(i=0,int(n));i<n____;++i)
#define FOR_C_N(i, a, b) for (int b____=(i=0,int(b);i<b____;++i)
#define DWN_C_N(i, b, a) for (int a____=(i=b-1,int(a));i>=a____;--i)
#define REP_1_C_N(i, n) for (int n____=(i=1,int(n));i<=n____;++i)
#define FOR_1_C_N(i, a, b) for (int b____=(i=1,int(b);i<=b____;++i)
#define DWN_1_C_N(i, b, a) for (int a____=(i=b,int(a));i>=a____;--i)

#define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it)
#define REP_S(i, str) for (char*i=str;*i;++i)
#define REP_L(i, hd, nxt) for (int i=hd;i;i=nxt[i])
#define REP_G(i, u) REP_L(i,hd[u],suc)
#define DO(n) for ( int ____n ## __line__ = n; ____n ## __line__ -- ; )
#define REP_2(i, j, n, m) REP(i, n) REP(j, m)
#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)
#define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l)
#define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l)
#define REP_4(i, j, k, ii, n, m, l, nn) REP(i, n) REP(j, m) REP(k, l) REP(ii, nn)
#define REP_4_1(i, j, k, ii, n, m, l, nn) REP_1(i, n) REP_1(j, m) REP_1(k, l) REP_1(ii, nn)

#define ALL(A) A.begin(), A.end()
#define LLA(A) A.rbegin(), A.rend()
#define CPY(A, B) memcpy(A, B, sizeof(A))
#define INS(A, P, B) A.insert(A.begin() + P, B)
#define ERS(A, P) A.erase(A.begin() + P)
#define BSC(A, x) (lower_bound(ALL(A), x) - A.begin())
#define CTN(T, x) (T.find(x) != T.end())
#define SZ(A) int(A.size())
#define PB push_back
#define MP(A, B) make_pair(A, B)
#define PTT pair<T, T>
#define fi first
#define se second

#define Rush for(int ____T=RD(); ____T--;)

#define Display(A, n, m) {                      \
  REP(i, n){		                            \
        REP(j, m) cout << A[i][j] << " ";       \
        cout << endl;				            \
	}						                    \
}

#define Display_1(A, n, m) {				    \
	REP_1(i, n){		                        \
        REP_1(j, m) cout << A[i][j] << " ";     \
		cout << endl;		            		\
	}						                    \
}

#pragma comment(linker, "/STACK:36777216")
//#pragma GCC optimize ("O2")
#define Ruby system("ruby main.rb")
#define Haskell system("runghc main.hs")
#define Python system("python main.py")
#define Pascal system("fpc main.pas")

typedef long long LL;
//typedef long double DB;
typedef double DB;
typedef unsigned UINT;
typedef unsigned long long ULL;

typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<string> VS;
typedef vector<LL> VL;
typedef vector<DB> VF;
typedef set<int> SI;
typedef set<string> SS;
typedef map<int, int> MII;
typedef map<string, int> MSI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<VII> VVII;

template<class T> inline T& RD(T &);
template<class T> inline void OT(const T &);
inline LL RD(){LL x; return RD(x);}
inline DB& RF(DB &);
inline DB RF(){DB x; return RF(x);}
inline char* RS(char *s);
inline char& RC(char &c);
inline char RC();
inline char& RC(char &c){scanf(" %c", &c); return c;}
inline char RC(){char c; return RC(c);}
//inline char& RC(char &c){c = getchar(); return c;}
//inline char RC(){return getchar();}

template<class T> inline T& RDD(T &x){
    char c; for (c = getchar(); c < '-'; c = getchar());
    if (c == '-'){x = '0' - getchar(); for (c = getchar(); '0' <= c && c <= '9'; c = getchar()) x = x * 10 + '0' - c;}
    else {x = c - '0'; for (c = getchar(); '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';}
    return x;
}

inline LL RDD(){LL x; return RDD(x);}

template<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;}
template<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;}
template<class T0, class T1, class T2, class T3> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3); return x0;}
template<class T0, class T1, class T2, class T3, class T4> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4); return x0;}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5); return x0;}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6); return x0;}
template<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);}
template<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);}
template<class T0, class T1, class T2, class T3> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}
template<class T0, class T1, class T2, class T3, class T4> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5, const T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}
inline char& RC(char &a, char &b){RC(a), RC(b); return a;}
inline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;}
inline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;}
inline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;}
inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f); return a;}
inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f, char &g){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f), RC(g); return a;}
inline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;}
inline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f, DB &g){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f), RF(g); return a;}
inline void RS(char *s1, char *s2){RS(s1), RS(s2);}
inline void RS(char *s1, char *s2, char *s3){RS(s1), RS(s2), RS(s3);}
template<class T0,class T1>inline void RDD(const T0&a, const T1&b){RDD(a),RDD(b);}
template<class T0,class T1,class T2>inline void RDD(const T0&a, const T1&b, const T2&c){RDD(a),RDD(b),RDD(c);}

template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}
template<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}
template<class T> inline void CLR(T &A){A.clear();}

template<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}
template<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}
template<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);}
template<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);}
template<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);}
template<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x);}
template<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x);}
template<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x);}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x);}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x), FLC(A6, x);}
template<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){while (!Q.empty()) Q.pop();}
template<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){while (!Q.empty()) Q.pop();}
template<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}
template<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);}
template<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);}
template<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);}
template<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);}

template<class T> inline T& SRT(T &A){sort(ALL(A)); return A;}
template<class T, class C> inline T& SRT(T &A, C B){sort(ALL(A), B); return A;}
template<class T> inline T& UNQ(T &A){A.resize(unique(ALL(SRT(A)))-A.begin());return A;}

//}

/** Constant List .. **/ //{

const int MOD = int(1e9 + 7);
//int MOD = 99990001;
const int INF = 0x3f3f3f3f;
const LL INFF = 1LL << 60;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

//}

/** Add On .. **/ //{
// <<= '0. Nichi Joo ., //{
template<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}
template<class T> inline void checkMax(T &a,const T b){if (a<b) a=b;}
template<class T> inline void checkMin(T &a, T &b, const T x){checkMin(a, x), checkMin(b, x);}
template<class T> inline void checkMax(T &a, T &b, const T x){checkMax(a, x), checkMax(b, x);}
template <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}
template <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}
template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}
template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}
template<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));}
template<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));}
template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T cub(T a){return a*a*a;}
inline int ceil(int x, int y){return (x - 1) / y + 1;}
inline int sgn(DB x){return x < -EPS ? -1 : x > EPS;}
inline int sgn(DB x, DB y){return sgn(x - y);}
//}
// <<= '1. Bitwise Operation ., //{
namespace BO{

inline bool _1(int x, int i){return bool(x&1<<i);}
inline bool _1(LL x, int i){return bool(x&1LL<<i);}
inline LL _1(int i){return 1LL<<i;}
inline LL _U(int i){return _1(i) - 1;};

inline int reverse_bits(int x){
    x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa);
    x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc);
    x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0);
    x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00);
    x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000);
    return x;
}

inline LL reverse_bits(LL x){
    x = ((x >> 1) & 0x5555555555555555LL) | ((x << 1) & 0xaaaaaaaaaaaaaaaaLL);
    x = ((x >> 2) & 0x3333333333333333LL) | ((x << 2) & 0xccccccccccccccccLL);
    x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) | ((x << 4) & 0xf0f0f0f0f0f0f0f0LL);
    x = ((x >> 8) & 0x00ff00ff00ff00ffLL) | ((x << 8) & 0xff00ff00ff00ff00LL);
    x = ((x >>16) & 0x0000ffff0000ffffLL) | ((x <<16) & 0xffff0000ffff0000LL);
    x = ((x >>32) & 0x00000000ffffffffLL) | ((x <<32) & 0xffffffff00000000LL);
    return x;
}

template<class T> inline bool odd(T x){return x&1;}
template<class T> inline bool even(T x){return !odd(x);}
template<class T> inline T low_bit(T x) {return x & -x;}
template<class T> inline T high_bit(T x) {T p = low_bit(x);while (p != x) x -= p, p = low_bit(x);return p;}
template<class T> inline T cover_bit(T x){T p = 1; while (p < x) p <<= 1;return p;}

inline int low_idx(int x){return __builtin_ffs(x);}
inline int low_idx(LL x){return __builtin_ffsll(x);}
inline int high_idx(int x){return low_idx(reverse_bits(x));}
inline int high_idx(LL x){return low_idx(reverse_bits(x));}
inline int clz(int x){return __builtin_clz(x);}
inline int clz(LL x){return __builtin_clzll(x);}
inline int ctz(int x){return __builtin_ctz(x);}
inline int ctz(LL x){return __builtin_ctzll(x);}
inline int parity(int x){return __builtin_parity(x);}
inline int parity(LL x){return __builtin_parityll(x);}
inline int lg2(int a){return 31 - clz(a);}
inline int lg2(LL a){return 63 - clz(a);}
inline int count_bits(int x){return __builtin_popcount(x);}
inline int count_bits(LL x){return __builtin_popcountll(x);}

} using namespace BO;//}
// <<= '2. Number Theory .,//{
namespace NT{
inline LL __lcm(LL a, LL b){return a*b/__gcd(a,b);}
inline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;}
inline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;}
inline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;}
inline int dff(int a, int b){a -= b; if (a < 0) a  += MOD; return a;}
inline void MUL(int &a, int b){a = (LL)a * b % MOD;}
inline int pdt(int a, int b){return (LL)a * b % MOD;}

inline int sum(int a, int b, int c){return sum(sum(a, b), c);}
inline int sum(int a, int b, int c, int d){return sum(sum(a, b), sum(c, d));}
inline int pdt(int a, int b, int c){return pdt(pdt(a, b), c);}
inline int pdt(int a, int b, int c, int d){return pdt(pdt(pdt(a, b), c), d);}

inline int pow(int a, int b){
    int c(1); while (b){
        if (b&1) MUL(c, a);
        MUL(a, a), b >>= 1;
    }
    return c;
}

inline int pow(int a, LL b){
    int c(1); while (b){
        if (b&1) MUL(c, a);
        MUL(a, a), b >>= 1;
    }
    return c;
}

template<class T> inline T pow(T a, LL b){
    T c(1); while (b){
        if (b&1) c *= a;
        a *= a, b >>= 1;
    }
    return c;
}

inline int _I(int b){
    int a = MOD, x1 = 0, x2 = 1, q;
    while (true){
        q = a / b, a %= b;
        if (!a) return (x2 + MOD) % MOD;
        DEC(x1, pdt(q, x2));

        q = b / a, b %= a;
        if (!b) return (x1 + MOD) % MOD;
        DEC(x2, pdt(q, x1));
    }
}

inline void DIV(int &a, int b){MUL(a, _I(b));}
inline int qtt(int a, int b){return pdt(a, _I(b));}

inline int phi(int n){
    int res = n; for (int i=2;sqr(i)<=n;++i) if (!(n%i)){
        DEC(res, qtt(res, i));
        do{n /= i;} while(!(n%i));
    }
    if (n != 1)
        DEC(res, qtt(res, n));
    return res;
}

} using namespace NT;//}
//}

/** I/O Accelerator Interface .. **/ //{
template<class T> inline T& RD(T &x){
    //cin >> x;
    //scanf("%d", &x);
    char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
    //char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';
    return x;
}

inline DB& RF(DB &x){
    //cin >> x;
    scanf("%lf", &x);
    /*char t; while ((t=getchar())==' '||t=='\n'); x = t - '0';
    while ((t=getchar())!=' '&&t!='\n'&&t!='.')x*=10,x+=t-'0';
    if (t=='.'){DB l=1; while ((t=getchar())!=' '&&t!='\n')l*=0.1,x += (t-'0')*l;}*/
    return x;
}

inline char* RS(char *s){
    //gets(s);
    scanf("%s", s);
    return s;
}

int Case; template<class T> inline void OT(const T &x){
    //printf("Case %d: %d\n", ++Case, x);
    //printf("%.2lf\n", x);
    printf("%d\n", x);
    //cout << x << endl;
}
//}

//}/* .................................................................................................................................. */

const int N = 100009, M = 2 * N, LM = 24;
int hd[N], suc[M], to[M], wt[M];

int ST[LM][M], st[N], dep[N]; // Euler index ...;
int L[N], R[N], A[M], S[4*M], T[4*M];
int n, a, b, nn, tt;

inline bool elder(int a, int b){
    return dep[a] < dep[b];
}

inline int lca(int a, int b){
    int l = st[a], r = st[b];
    if (l > r) swap(l, r); ++r; int lv = log2(r - l);
    return min(ST[lv][l], ST[lv][r-(1<<lv)], elder);
}

#define aa to[i^1]
#define bb to[i]
#define v bb
#define w wt[i]

void dfs(int u = 1){
    L[u] = ++nn, ST[0][st[u] = ++tt] = u;
    REP_G(i, u) if (!L[v]){
        dep[v] = dep[u] + 1, dfs(v), A[L[v]] = w, A[R[v]] = -w;
        ST[0][++tt] = u;
    }
    R[u] = ++nn;
}

#define lx (x<<1)
#define rx (lx|1)
#define mid (l + r >> 1)
#define lc lx, l, mid
#define rc rx, mid+1, r
#define root 1, 1, nn

void Build(int x, int l, int r){
    if (l == r) T[x] = max(0, S[x] = A[l]);
    else {
        Build(lc), Build(rc);
        S[x] = S[lx] + S[rx];
        T[x] = max(T[lx], S[lx] + T[rx]);
    }
}

void Get(int x, int l, int r){ // get  interval
    if (a <= l && r <= b) A[tt++] = x;
    else{
        if (a <= mid) Get(lc);
        if (mid < b) Get(rc);
    }
}

int Q1(int a, int b){
    ::a = a, ::b = b, tt = 0, Get(root);
    int res = 0; REP(i, tt) res += S[A[i]];
    return res;
}

int Q2(int a, int b){
    ::a = a, ::b = b, tt = 0, Get(root);
    int res = 0, sss = 0; REP(i, tt){
        int ai = A[i];
        checkMax(res, sss + T[ai]);
        sss += S[ai];
    }
    return res;
}

void Modify(int x, int l, int r){
    if (l == r) T[x] = max(0, S[x] = b);
    else {
        if (a <= mid) Modify(lc);
        else Modify(rc);
        S[x] = S[lx] + S[rx];
        T[x] = max(T[lx], S[lx] + T[rx]);
    }
}

int main(){

#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
#endif

    Rush{

        RST(hd, L, A, S, T), tt = nn = 0; FOR_C(i, 2, RD(n) << 1){
            RD(aa, bb); RDD(wt[i]), wt[i|1] = wt[i];
            suc[i] = hd[aa], hd[aa] = i, ++i;
            suc[i] = hd[aa], hd[aa] = i;
        }

        dfs();

        Build(root);

        for ( int lv = 1 ; (1 << lv) <= tt ; lv ++ ){
            for ( int i = 1 ; i + (1 << lv)  <= tt + 1 ; i ++ )
                ST[lv][i] = min(ST[lv-1][i], ST[lv-1][i + (1<<(lv-1))], elder);
        }

        //REP_1(i, nn) cout << A[i] << " "; cout << endl;
        //REP_1(i, nn) cout << Sum(i, i) << " "; cout <<endl;

        int cmd; int x = 1, y, z; Rush{
            RD(cmd); if (cmd == 1){
                z = lca(x, RD(y));
                OT(Q1(L[z]+1, L[x]) + Q1(L[z]+1, L[y]));
                x = y;
            } else if (cmd == 2){
                OT(Q2(L[x]+1, R[x]-1));
            } else {
                int x; RD(x, y), RDD(z); //if (elder(y, x)) y = x;
                a = L[y], b = z, Modify(root);
                a = R[y], b = -z, Modify(root);
            }
        }
    }
}
	/ Micro Mezzo Macro Flation -- Overheated Economy ., Last Update: Jan. 28th 2013 / //{

	/ Header .. / //{
	#define LOCAL

	#include <functional>
	#include <algorithm>
	#include <iostream>
	#include <fstream>
	#include <sstream>
	#include <iomanip>
	#include <numeric>
	#include <cstring>
	#include <cassert>
	#include <cstdio>
	#include <string>
	#include <vector>
	#include <bitset>
	#include <queue>
	#include <stack>
	#include <cmath>
	#include <ctime>
	#include <list>
	#include <set>
	#include <map>

	using namespace std;

	#define REP(i, n) for (int i=0;i<int(n);++i)
	#define FOR(i, a, b) for (int i=int(a);i<int(b);++i)
	#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i)
	#define REP_1(i, n) for (int i=1;i<=int(n);++i)
	#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)
	#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i)
	#define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i)
	#define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i)
	#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i)
	#define REP_N(i, n) for (i=0;i<int(n);++i)
	#define FOR_N(i, a, b) for (i=int(a);i<int(b);++i)
	#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i)
	#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)
	#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)
	#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i)
	#define REP_1_N(i, n) for (i=1;i<=int(n);++i)
	#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)
	#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i)
	#define REP_C_N(i, n) for (int n____=(i=0,int(n));i<n____;++i)
	#define FOR_C_N(i, a, b) for (int b____=(i=0,int(b);i<b____;++i)
	#define DWN_C_N(i, b, a) for (int a____=(i=b-1,int(a));i>=a____;--i)
	#define REP_1_C_N(i, n) for (int n____=(i=1,int(n));i<=n____;++i)
	#define FOR_1_C_N(i, a, b) for (int b____=(i=1,int(b);i<=b____;++i)
	#define DWN_1_C_N(i, b, a) for (int a____=(i=b,int(a));i>=a____;--i)

	#define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it)
	#define REP_S(i, str) for (chari=str;i;++i)
	#define REP_L(i, hd, nxt) for (int i=hd;i;i=nxt[i])
	#define REP_G(i, u) REP_L(i,hd[u],suc)
	#define DO(n) for ( int ____n ## __line__ = n; ____n ## __line__ -- ; )
	#define REP_2(i, j, n, m) REP(i, n) REP(j, m)
	#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)
	#define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l)
	#define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l)
	#define REP_4(i, j, k, ii, n, m, l, nn) REP(i, n) REP(j, m) REP(k, l) REP(ii, nn)
	#define REP_4_1(i, j, k, ii, n, m, l, nn) REP_1(i, n) REP_1(j, m) REP_1(k, l) REP_1(ii, nn)

	#define ALL(A) A.begin(), A.end()
	#define LLA(A) A.rbegin(), A.rend()
	#define CPY(A, B) memcpy(A, B, sizeof(A))
	#define INS(A, P, B) A.insert(A.begin() + P, B)
	#define ERS(A, P) A.erase(A.begin() + P)
	#define BSC(A, x) (lower_bound(ALL(A), x) - A.begin())
	#define CTN(T, x) (T.find(x) != T.end())
	#define SZ(A) int(A.size())
	#define PB push_back
	#define MP(A, B) make_pair(A, B)
	#define PTT pair<T, T>
	#define fi first
	#define se second

	#define Rush for(int ____T=RD(); ____T--;)

	#define Display(A, n, m) { \
	REP(i, n){ \
	REP(j, m) cout << A[i][j] << " "; \
	cout << endl; \
	} \
	}

	#define Display_1(A, n, m) { \
	REP_1(i, n){ \
	REP_1(j, m) cout << A[i][j] << " "; \
	cout << endl; \
	} \
	}

	#pragma comment(linker, "/STACK:36777216")
	//#pragma GCC optimize ("O2")
	#define Ruby system("ruby main.rb")
	#define Haskell system("runghc main.hs")
	#define Python system("python main.py")
	#define Pascal system("fpc main.pas")

	typedef long long LL;
	//typedef long double DB;
	typedef double DB;
	typedef unsigned UINT;
	typedef unsigned long long ULL;

	typedef vector<int> VI;
	typedef vector<char> VC;
	typedef vector<string> VS;
	typedef vector<LL> VL;
	typedef vector<DB> VF;
	typedef set<int> SI;
	typedef set<string> SS;
	typedef map<int, int> MII;
	typedef map<string, int> MSI;
	typedef pair<int, int> PII;
	typedef pair<LL, LL> PLL;
	typedef vector<PII> VII;
	typedef vector<VI> VVI;
	typedef vector<VII> VVII;

	template<class T> inline T& RD(T &);
	template<class T> inline void OT(const T &);
	inline LL RD(){LL x; return RD(x);}
	inline DB& RF(DB &);
	inline DB RF(){DB x; return RF(x);}
	inline char* RS(char *s);
	inline char& RC(char &c);
	inline char RC();
	inline char& RC(char &c){scanf(" %c", &c); return c;}
	inline char RC(){char c; return RC(c);}
	//inline char& RC(char &c){c = getchar(); return c;}
	//inline char RC(){return getchar();}

	template<class T> inline T& RDD(T &x){
	char c; for (c = getchar(); c < '-'; c = getchar());
	if (c == '-'){x = '0' - getchar(); for (c = getchar(); '0' <= c && c <= '9'; c = getchar()) x = x * 10 + '0' - c;}
	else {x = c - '0'; for (c = getchar(); '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';}
	return x;
	}

	inline LL RDD(){LL x; return RDD(x);}

	template<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;}
	template<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;}
	template<class T0, class T1, class T2, class T3> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3); return x0;}
	template<class T0, class T1, class T2, class T3, class T4> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4); return x0;}
	template<class T0, class T1, class T2, class T3, class T4, class T5> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5); return x0;}
	template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6); return x0;}
	template<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);}
	template<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);}
	template<class T0, class T1, class T2, class T3> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}
	template<class T0, class T1, class T2, class T3, class T4> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}
	template<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}
	template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5, const T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}
	inline char& RC(char &a, char &b){RC(a), RC(b); return a;}
	inline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;}
	inline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;}
	inline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;}
	inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f); return a;}
	inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f, char &g){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f), RC(g); return a;}
	inline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;}
	inline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;}
	inline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;}
	inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;}
	inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f); return a;}
	inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f, DB &g){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f), RF(g); return a;}
	inline void RS(char s1, char s2){RS(s1), RS(s2);}
	inline void RS(char s1, char s2, char *s3){RS(s1), RS(s2), RS(s3);}
	template<class T0,class T1>inline void RDD(const T0&a, const T1&b){RDD(a),RDD(b);}
	template<class T0,class T1,class T2>inline void RDD(const T0&a, const T1&b, const T2&c){RDD(a),RDD(b),RDD(c);}

	template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}
	template<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}
	template<class T> inline void CLR(T &A){A.clear();}

	template<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}
	template<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}
	template<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);}
	template<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);}
	template<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);}
	template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);}
	template<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);}
	template<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x);}
	template<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x);}
	template<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x);}
	template<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x);}
	template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x), FLC(A6, x);}
	template<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){while (!Q.empty()) Q.pop();}
	template<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){while (!Q.empty()) Q.pop();}
	template<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}
	template<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);}
	template<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);}
	template<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);}
	template<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);}
	template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);}
	template<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);}

	template<class T> inline T& SRT(T &A){sort(ALL(A)); return A;}
	template<class T, class C> inline T& SRT(T &A, C B){sort(ALL(A), B); return A;}
	template<class T> inline T& UNQ(T &A){A.resize(unique(ALL(SRT(A)))-A.begin());return A;}

	//}

	/ Constant List .. / //{

	const int MOD = int(1e9 + 7);
	//int MOD = 99990001;
	const int INF = 0x3f3f3f3f;
	const LL INFF = 1LL << 60;
	const DB EPS = 1e-9;
	const DB OO = 1e20;
	const DB PI = acos(-1.0); //M_PI;

	const int dx[] = {-1, 0, 1, 0};
	const int dy[] = {0, 1, 0, -1};

	//}

	/ Add On .. / //{
	// <<= '0. Nichi Joo ., //{
	template<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}
	template<class T> inline void checkMax(T &a,const T b){if (a<b) a=b;}
	template<class T> inline void checkMin(T &a, T &b, const T x){checkMin(a, x), checkMin(b, x);}
	template<class T> inline void checkMax(T &a, T &b, const T x){checkMax(a, x), checkMax(b, x);}
	template <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}
	template <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}
	template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}
	template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}
	template<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));}
	template<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));}
	template<class T> inline T sqr(T a){return a*a;}
	template<class T> inline T cub(T a){return aaa;}
	inline int ceil(int x, int y){return (x - 1) / y + 1;}
	inline int sgn(DB x){return x < -EPS ? -1 : x > EPS;}
	inline int sgn(DB x, DB y){return sgn(x - y);}
	//}
	// <<= '1. Bitwise Operation ., //{
	namespace BO{

	inline bool _1(int x, int i){return bool(x&1<<i);}
	inline bool _1(LL x, int i){return bool(x&1LL<<i);}
	inline LL _1(int i){return 1LL<<i;}
	inline LL _U(int i){return _1(i) - 1;};

	inline int reverse_bits(int x){
	x = ((x >> 1) & 0x55555555) \| ((x << 1) & 0xaaaaaaaa);
	x = ((x >> 2) & 0x33333333) \| ((x << 2) & 0xcccccccc);
	x = ((x >> 4) & 0x0f0f0f0f) \| ((x << 4) & 0xf0f0f0f0);
	x = ((x >> 8) & 0x00ff00ff) \| ((x << 8) & 0xff00ff00);
	x = ((x >>16) & 0x0000ffff) \| ((x <<16) & 0xffff0000);
	return x;
	}

	inline LL reverse_bits(LL x){
	x = ((x >> 1) & 0x5555555555555555LL) \| ((x << 1) & 0xaaaaaaaaaaaaaaaaLL);
	x = ((x >> 2) & 0x3333333333333333LL) \| ((x << 2) & 0xccccccccccccccccLL);
	x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) \| ((x << 4) & 0xf0f0f0f0f0f0f0f0LL);
	x = ((x >> 8) & 0x00ff00ff00ff00ffLL) \| ((x << 8) & 0xff00ff00ff00ff00LL);
	x = ((x >>16) & 0x0000ffff0000ffffLL) \| ((x <<16) & 0xffff0000ffff0000LL);
	x = ((x >>32) & 0x00000000ffffffffLL) \| ((x <<32) & 0xffffffff00000000LL);
	return x;
	}

	template<class T> inline bool odd(T x){return x&1;}
	template<class T> inline bool even(T x){return !odd(x);}
	template<class T> inline T low_bit(T x) {return x & -x;}
	template<class T> inline T high_bit(T x) {T p = low_bit(x);while (p != x) x -= p, p = low_bit(x);return p;}
	template<class T> inline T cover_bit(T x){T p = 1; while (p < x) p <<= 1;return p;}

	inline int low_idx(int x){return __builtin_ffs(x);}
	inline int low_idx(LL x){return __builtin_ffsll(x);}
	inline int high_idx(int x){return low_idx(reverse_bits(x));}
	inline int high_idx(LL x){return low_idx(reverse_bits(x));}
	inline int clz(int x){return __builtin_clz(x);}
	inline int clz(LL x){return __builtin_clzll(x);}
	inline int ctz(int x){return __builtin_ctz(x);}
	inline int ctz(LL x){return __builtin_ctzll(x);}
	inline int parity(int x){return __builtin_parity(x);}
	inline int parity(LL x){return __builtin_parityll(x);}
	inline int lg2(int a){return 31 - clz(a);}
	inline int lg2(LL a){return 63 - clz(a);}
	inline int count_bits(int x){return __builtin_popcount(x);}
	inline int count_bits(LL x){return __builtin_popcountll(x);}

	} using namespace BO;//}
	// <<= '2. Number Theory .,//{
	namespace NT{
	inline LL __lcm(LL a, LL b){return a*b/__gcd(a,b);}
	inline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;}
	inline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;}
	inline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;}
	inline int dff(int a, int b){a -= b; if (a < 0) a += MOD; return a;}
	inline void MUL(int &a, int b){a = (LL)a * b % MOD;}
	inline int pdt(int a, int b){return (LL)a * b % MOD;}

	inline int sum(int a, int b, int c){return sum(sum(a, b), c);}
	inline int sum(int a, int b, int c, int d){return sum(sum(a, b), sum(c, d));}
	inline int pdt(int a, int b, int c){return pdt(pdt(a, b), c);}
	inline int pdt(int a, int b, int c, int d){return pdt(pdt(pdt(a, b), c), d);}

	inline int pow(int a, int b){
	int c(1); while (b){
	if (b&1) MUL(c, a);
	MUL(a, a), b >>= 1;
	}
	return c;
	}

	inline int pow(int a, LL b){
	int c(1); while (b){
	if (b&1) MUL(c, a);
	MUL(a, a), b >>= 1;
	}
	return c;
	}

	template<class T> inline T pow(T a, LL b){
	T c(1); while (b){
	if (b&1) c *= a;
	a *= a, b >>= 1;
	}
	return c;
	}

	inline int _I(int b){
	int a = MOD, x1 = 0, x2 = 1, q;
	while (true){
	q = a / b, a %= b;
	if (!a) return (x2 + MOD) % MOD;
	DEC(x1, pdt(q, x2));

	q = b / a, b %= a;
	if (!b) return (x1 + MOD) % MOD;
	DEC(x2, pdt(q, x1));
	}
	}

	inline void DIV(int &a, int b){MUL(a, _I(b));}
	inline int qtt(int a, int b){return pdt(a, _I(b));}

	inline int phi(int n){
	int res = n; for (int i=2;sqr(i)<=n;++i) if (!(n%i)){
	DEC(res, qtt(res, i));
	do{n /= i;} while(!(n%i));
	}
	if (n != 1)
	DEC(res, qtt(res, n));
	return res;
	}

	} using namespace NT;//}
	//}

	/ I/O Accelerator Interface .. / //{
	template<class T> inline T& RD(T &x){
	//cin >> x;
	//scanf("%d", &x);
	char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
	//char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';
	return x;
	}

	inline DB& RF(DB &x){
	//cin >> x;
	scanf("%lf", &x);
	/*char t; while ((t=getchar())==' '\|\|t=='\n'); x = t - '0';
	while ((t=getchar())!=' '&&t!='\n'&&t!='.')x*=10,x+=t-'0';
	if (t=='.'){DB l=1; while ((t=getchar())!=' '&&t!='\n')l=0.1,x += (t-'0')l;}*/
	return x;
	}

	inline char* RS(char *s){
	//gets(s);
	scanf("%s", s);
	return s;
	}

	int Case; template<class T> inline void OT(const T &x){
	//printf("Case %d: %d\n", ++Case, x);
	//printf("%.2lf\n", x);
	printf("%d\n", x);
	//cout << x << endl;
	}
	//}

	//}/* .................................................................................................................................. */

	const int N = 100009, M = 2 * N, LM = 24;
	int hd[N], suc[M], to[M], wt[M];

	int ST[LM][M], st[N], dep[N]; // Euler index ...;
	int L[N], R[N], A[M], S[4M], T[4M];
	int n, a, b, nn, tt;

	inline bool elder(int a, int b){
	return dep[a] < dep[b];
	}

	inline int lca(int a, int b){
	int l = st[a], r = st[b];
	if (l > r) swap(l, r); ++r; int lv = log2(r - l);
	return min(ST[lv][l], ST[lv][r-(1<<lv)], elder);
	}

	#define aa to[i^1]
	#define bb to[i]
	#define v bb
	#define w wt[i]

	void dfs(int u = 1){
	L[u] = ++nn, ST[0][st[u] = ++tt] = u;
	REP_G(i, u) if (!L[v]){
	dep[v] = dep[u] + 1, dfs(v), A[L[v]] = w, A[R[v]] = -w;
	ST[0][++tt] = u;
	}
	R[u] = ++nn;
	}

	#define lx (x<<1)
	#define rx (lx\|1)
	#define mid (l + r >> 1)
	#define lc lx, l, mid
	#define rc rx, mid+1, r
	#define root 1, 1, nn

	void Build(int x, int l, int r){
	if (l == r) T[x] = max(0, S[x] = A[l]);
	else {
	Build(lc), Build(rc);
	S[x] = S[lx] + S[rx];
	T[x] = max(T[lx], S[lx] + T[rx]);
	}
	}

	void Get(int x, int l, int r){ // get interval
	if (a <= l && r <= b) A[tt++] = x;
	else{
	if (a <= mid) Get(lc);
	if (mid < b) Get(rc);
	}
	}

	int Q1(int a, int b){
	::a = a, ::b = b, tt = 0, Get(root);
	int res = 0; REP(i, tt) res += S[A[i]];
	return res;
	}

	int Q2(int a, int b){
	::a = a, ::b = b, tt = 0, Get(root);
	int res = 0, sss = 0; REP(i, tt){
	int ai = A[i];
	checkMax(res, sss + T[ai]);
	sss += S[ai];
	}
	return res;
	}

	void Modify(int x, int l, int r){
	if (l == r) T[x] = max(0, S[x] = b);
	else {
	if (a <= mid) Modify(lc);
	else Modify(rc);
	S[x] = S[lx] + S[rx];
	T[x] = max(T[lx], S[lx] + T[rx]);
	}
	}

	int main(){

	#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	#endif

	Rush{

	RST(hd, L, A, S, T), tt = nn = 0; FOR_C(i, 2, RD(n) << 1){
	RD(aa, bb); RDD(wt[i]), wt[i\|1] = wt[i];
	suc[i] = hd[aa], hd[aa] = i, ++i;
	suc[i] = hd[aa], hd[aa] = i;
	}

	dfs();

	Build(root);

	for ( int lv = 1 ; (1 << lv) <= tt ; lv ++ ){
	for ( int i = 1 ; i + (1 << lv) <= tt + 1 ; i ++ )
	ST[lv][i] = min(ST[lv-1][i], ST[lv-1][i + (1<<(lv-1))], elder);
	}

	//REP_1(i, nn) cout << A[i] << " "; cout << endl;
	//REP_1(i, nn) cout << Sum(i, i) << " "; cout <<endl;

	int cmd; int x = 1, y, z; Rush{
	RD(cmd); if (cmd == 1){
	z = lca(x, RD(y));
	OT(Q1(L[z]+1, L[x]) + Q1(L[z]+1, L[y]));
	x = y;
	} else if (cmd == 2){
	OT(Q2(L[x]+1, R[x]-1));
	} else {
	int x; RD(x, y), RDD(z); //if (elder(y, x)) y = x;
	a = L[y], b = z, Modify(root);
	a = R[y], b = -z, Modify(root);
	}
	}
	}
	}