1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<cstdlib>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define mid (x+y>>1)
#define sqr(x) ((x)*(x))
#define NM 200005
#define nm 400005
using namespace std;
const double pi=acos(-1);
const ll inf=1e9+7;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct edge{int t,v;edge*next;}e[nm],*h[NM],*o=e;
void add(int x,int y,int v){o->t=y;o->v=v;o->next=h[x];h[x]=o++;}
int n,m,_x,_y,_t,d[NM][2],p[NM][2],ans;
void dfs1(int x,int f){
int s1=0,s2=0,t1=0,t2=0;
link(x)if(j->t!=f){
dfs1(j->t,x);
if(d[j->t][0]+j->v>s1)s2=s1,t2=t1,s1=d[j->t][0]+j->v,t1=min(d[j->t][1]+j->v,d[j->t][0]);
else if(d[j->t][0]+j->v>s2)s2=d[j->t][0]+j->v,t2=max(d[j->t][1]+j->v,d[j->t][0]);
}
d[x][0]=s1;d[x][1]=max(t1,s2);
}
void dfs2(int x,int f){
int s1=0,s2=0,s3=0,t1=0,t2=0,t3=0,i1=0,i2=0,i3=0;
link(x)if(j->t!=f){
if(d[j->t][0]+j->v>s1)s3=s2,t3=t2,i3=i2,s2=s1,t2=t1,i2=i1,s1=d[j->t][0]+j->v,t1=min(d[j->t][1]+j->v,d[j->t][0]),i1=j->t;
else if(d[j->t][0]+j->v>s2)s3=s2,t3=t2,i3=i2,s2=d[j->t][0]+j->v,t2=min(d[j->t][1]+j->v,d[j->t][0]),i2=j->t;
else if(d[j->t][0]+j->v>s3)s3=d[j->t][0]+j->v,t3=min(d[j->t][1]+j->v,d[j->t][0]),i3=j->t;
}
link(x)if(j->t!=f){
if(j->t==i1){
p[j->t][0]=max(s2,p[x][0])+j->v;
p[j->t][1]=min(min(max(p[x][0],max(t2,s3)),max(p[x][1],s2))+j->v,max(s2,p[x][0]));
}else if(j->t==i2){
p[j->t][0]=max(s1,p[x][0])+j->v;
p[j->t][1]=min(min(max(p[x][0],max(t1,s3)),max(p[x][1],s1))+j->v,max(s1,p[x][0]));
}else{
p[j->t][0]=max(s1,p[x][0])+j->v;
p[j->t][1]=min(min(max(p[x][0],max(t1,s2)),max(p[x][1],s1))+j->v,max(s1,p[x][0]));
}
dfs2(j->t,x);
}
}
int main(){
int _=read();while(_--){
n=read();
inc(i,1,n)h[i]=0;o=e;
inc(i,2,n){_x=read();_y=read();_t=read();add(_x,_y,_t);add(_y,_x,_t);}
inc(i,1,n)inc(j,0,1)d[i][j]=p[i][j]=0;
dfs1(1,0);dfs2(1,0);ans=inf;
inc(i,1,n)inc(j,0,1)ans=min(ans,max(d[i][j],p[i][j^1]));
inc(i,1,n)if(ans==max(d[i][0],p[i][1])||ans==max(d[i][1],p[i][0])){printf("%d ",i);break;}
printf("%d\n",ans);
}
return 0;
}
|
