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;
const int N = 2e5 + 21;
int nex[N * 2], cnt, head[N], to[N * 2], w[N * 2], vis[N];
long long siz[N], a[N], f[N], ans = -100;
int ans1, out[N], rk[N * 2], in[N], dfn;
double sum, dans;
void link(int x, int y, int z) {
  nex[++cnt] = head[x];
  head[x] = cnt;
  to[cnt] = y;
  w[cnt] = z;
}
void dfs(int u, int pre) {
  siz[u] = a[u];
  in[u] = ++dfn;
  rk[dfn] = u;
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    if (v != pre) dfs(v, u);
    siz[u] += siz[v];
    f[u] += f[v] + w[i] * siz[v];
  }
  out[u] = ++dfn;
  rk[dfn] = u;
}
void dfs2(int u, int pre) {
  if (f[u] > ans) ans = f[u], ans1 = u;
  long long fu = f[u], sizu = siz[u];
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    if (v == pre) continue;
    siz[u] -= siz[v];
    f[u] -= f[v] + w[i] * siz[v];
    siz[v] += siz[u];
    f[v] += f[u] * w[i] * siz[u];
    dfs2(v, u);
    f[u] = fu;
    siz[u] = sizu;
  }
}
void dfs3(int u, long long dep, int pre) {
  sum += a[u] * sqrt(dep) * dep;
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    if (v == pre) continue;
    dfs3(v, dep + w[i], u);
  }
}
int cs;
double find(int rt) {
  rt = rk[rt];
  sum = 0;
  dfs3(rt, 0, 0);
  if (dans > sum) {
    dans = sum, ans1 = rt;
  }
  return sum;
}
double myrand() { return (double)rand() / RAND_MAX; }
int now;
void SA() {
  double T = dfn, last = find(now);
  while (T > 1) {
    int nex = now + (myrand() - (double)now / dfn) * T;
    if (nex >= 1 && nex <= dfn) {
      double tmp = find(nex);
      if (tmp < last)
        now = nex, last = tmp;
      else if (exp(-(tmp - last) / T) > myrand())
        now = nex, last = tmp;
    }
    T *= 0.98;
  }
  for (int i = -5; i <= 5; i++)
    if (i && now + i <= dfn && now + i > 0) find(now + i);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (int i = 1, x, y, z; i < n; i++)
    scanf("%d%d%d", &x, &y, &z), link(x, y, z), link(y, x, z);
  dfs(1, 0);
  dfs2(1, 0);
  now = in[ans1];
  dans = 1e19;
  while (clock() < 1.5 * CLOCKS_PER_SEC) SA();
  printf("%d %.12lf\n", ans1, dans);
  return 0;
}
