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>
int inp() {
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  int sum = 0;
  while (c >= '0' && c <= '9') {
    sum = sum * 10 + c - '0';
    c = getchar();
  }
  return sum;
}
int head[200010], nxt[400010], end[400010], size[200010];
double w[200010], value[400010];
int cou = 0;
void link(int a, int b, int v) {
  nxt[++cou] = head[a];
  head[a] = cou;
  end[cou] = b;
  value[cou] = v;
}
double sum, _f, f[200010];
void _dfs(int cur, int last, double dis) {
  sum += pow(dis, 1.5) * w[cur];
  _f += 1.5 * pow(dis, 0.5) * w[cur];
  for (int x = head[cur]; x != -1; x = nxt[x])
    if (end[x] != last) _dfs(end[x], cur, dis + value[x]);
}
bool used[200010];
int tot, root, min;
void dfs0(int cur, int last) {
  size[cur] = 1;
  int max = 0;
  for (int x = head[cur]; x != -1; x = nxt[x]) {
    if (end[x] != last && !used[end[x]]) {
      dfs0(end[x], cur);
      max = std::max(max, size[end[x]]);
      size[cur] += size[end[x]];
    }
  }
  max = std::max(max, tot - size[cur]);
  if (max < min) {
    min = max;
    root = cur;
  }
}
int rt;
double ans = 1e22;
int dfs(int cur) {
  dfs0(cur, 0);
  tot = size[cur];
  min = 2147483647;
  dfs0(cur, 0);
  cur = root;
  used[cur] = true;
  double fsum = 0;
  sum = 0;
  for (int x = head[cur]; x != -1; x = nxt[x]) {
    _f = 0;
    _dfs(end[x], cur, value[x]);
    f[end[x]] = _f;
    fsum += _f;
  }
  if (sum < ans) {
    ans = sum;
    rt = cur;
  }
  for (int x = head[cur]; x != -1; x = nxt[x])
    if (fsum - (f[end[x]] * 2.0) < 0 && !used[end[x]]) return dfs(end[x]);
  return cur;
}
int main() {
  memset(head, -1, sizeof(head));
  int n = inp();
  for (int i = 1; i <= n; i++) w[i] = inp();
  for (int i = 1; i < n; i++) {
    int u = inp();
    int v = inp();
    int w = inp();
    link(u, v, w);
    link(v, u, w);
  }
  dfs(1);
  printf("%d %.10lf\n", rt, ans);
}
