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 = 200200, oo = 1000000000;
int i, j, k, n, m, x, y, v, En, ans, tmp, ch, rt, mi, Size, Up;
int h[N], dis[N], w[N], fg[N], p[N], sz[N], z[N];
double f[N], sum[N];
struct edge {
  int s, n, v;
} E[N << 1];
void R(int &x) {
  x = 0;
  ch = getchar();
  while (ch < '0' || '9' < ch) ch = getchar();
  while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
}
void E_add(int x, int y, int v) {
  E[++En].s = y;
  E[En].v = v;
  E[En].n = h[x];
  h[x] = En;
  E[++En].s = x;
  E[En].v = v;
  E[En].n = h[y];
  h[y] = En;
}
void dfs(int x, int F) {
  sum[x] = 1.0 * dis[x] * sqrt(1.0 * dis[x]) * w[x];
  for (int k = h[x]; k; k = E[k].n)
    if (E[k].s != F) {
      dis[E[k].s] = dis[x] + E[k].v;
      dfs(E[k].s, x);
      sum[x] += sum[E[k].s];
    }
}
bool cmp(const int &a, const int &b) { return sum[a] > sum[b]; }
double F(int x) {
  if (fg[x]) return f[x];
  fg[x] = 1;
  dis[x] = 0;
  dfs(x, 0);
  return f[x] = sum[x];
}
void get_root(int x, int F) {
  int k, ma = 0;
  sz[x] = 1;
  for (k = h[x]; k; k = E[k].n)
    if (E[k].s != F && !z[E[k].s]) {
      get_root(E[k].s, x);
      sz[x] += sz[E[k].s];
      if (sz[E[k].s] > ma) ma = sz[E[k].s];
    }
  if (Size - sz[x] > ma) ma = Size - sz[x];
  if (ma < mi) mi = ma, rt = x;
}
void get_sz(int x, int F) {
  sz[x] = 1;
  for (int k = h[x]; k; k = E[k].n)
    if (E[k].s != F && !z[E[k].s]) {
      get_sz(E[k].s, x);
      sz[x] += sz[E[k].s];
    }
}
void Df(int x) {
  int i, j, k, nm = 0;
  z[x] = 1;
  get_sz(x, 0);
  for (k = h[x]; k; k = E[k].n)
    if (!z[E[k].s]) {
      for (i = 1; i <= nm; i++)
        if (sum[E[k].s] > sum[p[i]]) break;
      for (j = nm + 1; j > i; j--) p[j] = p[j - 1];
      p[i] = E[k].s;
      if (++nm > Up) nm = Up;
    }
  for (i = 1; i <= nm; i++)
    if (F(p[i]) < F(x)) {
      mi = oo;
      Size = sz[p[i]];
      get_root(p[i], 0);
      Df(rt);
      return;
    }
  ans = x;
}
int main() {
  R(n);
  if (n <= 5000)
    Up = n;
  else
    Up = 5;
  for (i = 1; i <= n; i++) R(w[i]);
  for (i = 1; i < n; i++) {
    R(x);
    R(y);
    R(v);
    E_add(x, y, v);
  }
  mi = oo;
  Size = n;
  get_root(1, 0);
  F(rt);
  Df(rt);
  printf("%d %.10lf\n", ans, f[ans]);
}
