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 <bits/stdc++.h>
using namespace std;
double Ans1;
bool V[200005];
int N, D, Ans2, w[200005], st[200005], siz[200005], Max[200005];
struct Lin {
  int v, c, next;
} E[200005 << 1];
void Link(int u, int v, int c) {
  E[++D] = (Lin){v, c, st[u]};
  st[u] = D;
  E[++D] = (Lin){u, c, st[v]};
  st[v] = D;
}
void DFS1(int u, int f) {
  siz[u] = 1;
  Max[u] = 0;
  for (int i = st[u], v; i; i = E[i].next)
    if (!V[v = E[i].v] && v != f)
      DFS1(v, u), siz[u] += siz[v], Max[u] = max(Max[u], siz[v]);
}
int DFS2(int u, int f, int S) {
  int Rt = u;
  Max[u] = max(Max[u], S - siz[u]);
  for (int i = st[u], v; i; i = E[i].next)
    if (!V[v = E[i].v] && v != f) {
      int t = DFS2(v, u, S);
      if (Max[t] < Max[Rt]) Rt = t;
    }
  return Rt;
}
void DFS3(int u, int f, int d, double& ret) {
  ret += d * sqrt(d) * w[u];
  for (int i = st[u], v; i; i = E[i].next)
    if ((v = E[i].v) ^ f) DFS3(v, u, d + E[i].c, ret);
}
void DFS4(int u, int f, int d, double& ret) {
  ret += sqrt(d) * w[u];
  for (int i = st[u], v; i; i = E[i].next)
    if ((v = E[i].v) != f) DFS4(v, u, d + E[i].c, ret);
}
void Work(int u) {
  DFS1(u, 0);
  V[u = DFS2(u, 0, siz[u])] = 1;
  double tot = 0, Max = -(1e100), t;
  int ID = -1;
  DFS3(u, 0, 0, tot);
  if (tot < Ans1) Ans1 = tot, Ans2 = u;
  for (int i = st[u], v; i; i = E[i].next)
    if (!V[v = E[i].v]) {
      t = 0, DFS4(v, u, E[i].c, t);
      if (t > Max) Max = t, ID = v;
    }
  if (ID != -1) Work(ID);
}
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%d", &w[i]);
  for (int i = 1, u, v, c; i < N; i++)
    scanf("%d%d%d", &u, &v, &c), Link(u, v, c);
  Ans1 = 1e100;
  Work(1);
  printf("%d %.10lf\n", Ans2, Ans1);
}
