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;
int n, i, x, y, z, num, sum, ans, now, Size, Cnt, pos, Time;
double Ans;
int w[200010], head[200010], vis[200010];
struct aa {
  int to, next, val;
} a[200010 * 2];
pair<int, int> point;
double f[200010];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch <= '9' && ch >= '0') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) write(x / 10);
  putchar(x % 10 + '0');
}
inline void add(int x, int y, int z) {
  num++;
  a[num].next = head[x];
  a[num].to = y;
  a[num].val = z;
  head[x] = num;
}
inline int dfs(int x, int fa, pair<int, int> &now, int Min) {
  int i, y, sum = 1, t;
  for (i = head[x]; i; i = a[i].next) {
    y = a[i].to;
    if (vis[y]) continue;
    if (y == fa) continue;
    sum += dfs(y, x, now, Min);
  }
  t = max(sum, Size - sum);
  if (t < Min) Min = t, now = make_pair(x, fa);
  return sum;
}
inline double getsum(int x, int fa, int dis) {
  int i, y;
  double sum = 0;
  sum += 1.0 * w[x] * dis * sqrt(dis);
  for (i = head[x]; i; i = a[i].next) {
    y = a[i].to;
    if (y == fa) continue;
    sum += getsum(y, x, dis + a[i].val);
  }
  return sum;
}
inline void calc(int x) {
  if (f[x] || Time > 360) return;
  Time++;
  f[x] = getsum(x, x, 0);
  if (f[x] < Ans) Ans = f[x], ans = x;
  return;
}
inline int getsize(int x, int fa) {
  int i, y, sum = 1;
  for (i = head[x]; i; i = a[i].next) {
    y = a[i].to;
    if (vis[y]) continue;
    if (y == fa) continue;
    sum += getsize(y, x);
  }
  return sum;
}
inline void work(int x) {
  Size = getsize(x, x);
  if (Size == 1) return;
  dfs(x, x, point, Size);
  calc(point.first);
  calc(point.second);
  if (Size <= 2) return;
  if (f[point.first] < f[point.second])
    vis[point.second] = 1, work(point.first);
  else
    vis[point.first] = 1, work(point.second);
}
int main() {
  srand(time(0));
  n = read();
  for (i = 1; i <= n; i++) w[i] = read();
  for (i = 1; i < n; i++) {
    x = read();
    y = read();
    z = read();
    add(x, y, z);
    add(y, x, z);
  }
  ans = 0;
  Ans = 1e100;
  for (i = 1; i <= 110; i++) {
    x = rand() % n + 1;
    if (ans == x) continue;
    f[x] = getsum(x, x, 0);
    if (f[x] < Ans)
      vis[ans] = 1, ans = x, Ans = f[ans];
    else
      vis[x] = 1;
  }
  work(ans);
  write(ans);
  putchar(' ');
  printf("%0.10lf", Ans);
}
