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 N = 500005;
int n, w[N], i, j, k, l, head[N], adj[N], nxt[N], len[N], root, Head[N], Adj[N],
    Nxt[N], sz[N], mx[N], pt[N];
bool v[N];
long double keke[N];
void Dfs(int x, int dad, int size) {
  sz[x] = 1;
  mx[x] = 0;
  for (int y = head[x]; y; y = nxt[y])
    if (adj[y] != dad && !v[adj[y]]) {
      Dfs(adj[y], x, size);
      sz[x] += sz[adj[y]];
      mx[x] = max(mx[x], sz[adj[y]]);
    }
  mx[x] = max(mx[x], size - sz[x]);
  if (!root || mx[x] < mx[root]) root = x;
}
int dfs(int x, int size) {
  root = 0;
  Dfs(x, -1, size);
  v[root] = true;
  int rtn = root;
  for (int y = head[root]; y; y = nxt[y])
    if (!v[adj[y]]) {
      int z = dfs(adj[y], sz[adj[y]]);
      Adj[++l] = z;
      Nxt[l] = Head[rtn];
      Head[rtn] = l;
      pt[l] = adj[y];
    }
  return rtn;
}
void dzx(int x, int dad, int d) {
  keke[x] = sqrt(d) * w[x] * d;
  for (int y = head[x]; y; y = nxt[y])
    if (adj[y] != dad) {
      dzx(adj[y], x, d + len[y]);
      keke[x] += keke[adj[y]];
    }
}
void work(int x) {
  dzx(x, -1, 0);
  int i = 0;
  for (int y = Head[x]; y; y = Nxt[y])
    if (i == 0 || keke[pt[y]] > keke[pt[i]]) i = y;
  long double w = keke[x];
  if (i) dzx(pt[i], -1, 0);
  if (i == 0 || w < keke[pt[i]]) {
    printf("%d %.12lf", x, (double)w);
    return;
  }
  work(Adj[i]);
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) scanf("%d", w + i);
  for (i = 1; i < n; ++i) {
    scanf("%d%d%d", &j, &k, &len[i * 2]);
    adj[i * 2 - 1] = k;
    nxt[i * 2 - 1] = head[j];
    head[j] = i * 2 - 1;
    adj[i * 2] = j;
    nxt[i * 2] = head[k];
    head[k] = i * 2;
    len[i * 2 - 1] = len[i * 2];
  }
  root = dfs(1, n);
  work(root);
  return 0;
}
