3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
typedef long double db;
const int N=2e5+100;
struct edge{
	int x,y,c,next;
}a[2*N];int len,last[N];
int b[N];
void ins(int x,int y,int c){
	a[++len].x=x;a[len].y=y;a[len].c=c;
	a[len].next=last[x];last[x]=len;
}
bool bk[N],bz[N];int size[N],root;
void find(int x,int fa,int c){
	bk[x]=false;int Max=0;
	for(int k=last[x];k;k=a[k].next){
		int y=a[k].y;
		if(bk[y]&&y!=fa){
			find(y,x,c);
			size[x]+=size[y];
			if(Max<size[y]) Max=size[y];
		}
	}
	size[x]++;
	if(Max<c-size[x]) Max=c-size[x];
	if(Max<=c/2) root=x;
}
db Sum[N],deep[N];
void dfs(int x){
	bz[x]=false;
	for(int k=last[x];k;k=a[k].next){
		int y=a[k].y;
		if(bz[y]){
			deep[y]=deep[x]+a[k].c;
			dfs(y);
			Sum[x]+=Sum[y];
			size[x]+=size[y];
		}
	}
	size[x]++;
	Sum[x]+=(1.5*sqrt(deep[x])*b[x]);
}
db ans2;
void dfs2(int x,int fa,db c){
	ans2+=(c*sqrt(c)*b[x]);
	for(int k=last[x];k;k=a[k].next){
		int y=a[k].y;
		if(y!=fa) dfs2(y,x,c+a[k].c);
	}
}
int Ans;db Ans2=1e18;
solve(int x){
	ans2=0;dfs2(x,0,0);
	if(Ans2>ans2) Ans2=ans2,Ans=x;
	memset(deep,0,sizeof(deep));
	memset(size,0,sizeof(size));
	memset(bz,true,sizeof(bz));
	dfs(x);
	for(int k=last[x];k;k=a[k].next){
		int y=a[k].y;
		if(bk[y]&&Sum[x]-2*Sum[y]<0){
			bk[x]=false;
			find(y,0,size[y]);
			solve(root);
		}
	}
}
int main()
{
	int n;scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&b[i]);
	len=0;memset(last,0,sizeof(last));
	for(int i=1;i<n;i++){
		int x,y,c;
		scanf("%d%d%d",&x,&y,&c);
		ins(x,y,c);ins(y,x,c);
	}
	memset(bk,true,sizeof(bk));
	find(1,0,n);
	memset(bk,true,sizeof(bk));
	solve(root);
	printf("%d\n",Ans);
	printf("%.10Lf\n",Ans2);
	return 0;
}