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;
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 5;
int read() {
  int s = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    s = s * 10 + c - '0';
    c = getchar();
  }
  return s * f;
}
int n, m, cnt, Min, Root, ans1;
double ans2, Sum, sump, p[N];
int h[N], a[N], sum[N], vis[N];
struct edge {
  int to, next, dist;
} d[N * 2];
void Add(int x, int y, int z) {
  d[++cnt] = (edge){y, h[x], z};
  h[x] = cnt;
}
void Find(int x, int fa, int num) {
  int S = 0;
  sum[x] = 1;
  for (int i = h[x]; i; i = d[i].next) {
    int y = d[i].to;
    if (y == fa || vis[y]) continue;
    Find(y, x, num);
    sum[x] += sum[y];
    S = max(S, sum[y]);
  }
  S = max(S, num - sum[x]);
  if (S < Min) {
    Min = S;
    Root = x;
  }
}
void DFS(int x, int fa, int tp, int dist) {
  Sum += pow(dist, 1.5) * a[x];
  p[tp] += 1.5 * pow(dist, 0.5) * a[x];
  for (int i = h[x]; i; i = d[i].next) {
    int y = d[i].to;
    if (y == fa) continue;
    DFS(y, x, tp, dist + d[i].dist);
  }
}
void Calc(int x) {
  Sum = sump = 0;
  for (int i = h[x]; i; i = d[i].next) {
    int y = d[i].to;
    p[y] = 0;
    DFS(y, x, y, d[i].dist);
    sump += p[y];
  }
  if (Sum < ans2) {
    ans1 = x;
    ans2 = Sum;
  }
}
void dfs(int x, int fa) {
  sum[x] = 1;
  for (int i = h[x]; i; i = d[i].next) {
    int y = d[i].to;
    if (y == fa || vis[y]) continue;
    dfs(y, x);
    sum[x] += sum[y];
  }
}
void Divide(int x, int num) {
  Min = inf;
  Root = 0;
  Find(x, 0, num);
  x = Root;
  vis[x] = 1;
  Calc(x);
  dfs(x, 0);
  for (int i = h[x]; i; i = d[i].next) {
    int y = d[i].to;
    if (vis[y]) continue;
    if (sump - p[y] * 2 < 0) Divide(y, sum[y]);
  }
}
int main() {
  n = read();
  ans2 = 1e20;
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i < n; i++) {
    int x = read(), y = read(), z = read();
    Add(x, y, z);
    Add(y, x, z);
  }
  Divide(1, n);
  printf("%d %.10lf", ans1, ans2);
  return 0;
}
