#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; ll dep[100010],dep2[100010]; ll par[100010][19]; vector

v[100010]; void dfs(ll x,ll y,ll d){ dep[x]=d; for(int i=0; i=0;i--){ if(par[a][i]!=par[b][i]) a=par[a][i],b=par[b][i]; } return par[a][0]; } int n; void init() { memset(par,0,sizeof(par)); dfs(0,-1,0); for(int i=0; i<18; i++)for(int j=0; j> n; rep(i,n-1) { ll x,y,z; cin >> x >> y >> z; v[x].pb(P(y,z)); v[y].pb(P(x,z)); } init(); ll T; cin >> T; while(T--) { ll x,y,z; cin >> x >> y >> z; ll r=lca(x,y); r=lca(r,z); if(r==y) swap(x,y); else if(r==z) swap(x,z); else if(lca(x,y)!=r) swap(x,z); else if(lca(x,z)!=r) swap(x,y); ll d1=D(x,y),d2=D(x,z),d3=D(y,z); ll c1=D(x,r),c2=D(y,r),c3=D(z,r); pr(c1+c2+c3-D(r,lca(y,z))); } } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}