#include<algorithm> #include<iostream> #include<cstring> #include<cstdio> using namespace std; const int maxn=1e5+10; int a1,b1,c1,n,cnt,cnt1,t,sum,head[maxn],fa[maxn],dep[maxn]; int f[maxn][30],g[maxn][30]; struct edge { int u,v,dis1; }e[4*maxn]; struct node { int next,t...