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 siz[200010];
int addnum, vel[400010], key[400010], ne[400010], head[400010];
int n, m, mn, sizd, rt;
int a[200010];
int vis[200010], ans;
double sum[200010], anss, sumt;
inline int read() {
  int ans = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9')
    ans = (ans << 1) + (ans << 3) + ch - '0', ch = getchar();
  return ans;
}
void add(int u, int v, int k) {
  addnum++, vel[addnum] = v, key[addnum] = k, ne[addnum] = head[u],
            head[u] = addnum;
}
void get_rt(int u, int fa) {
  siz[u] = 1;
  int maxn = 0;
  for (int e = head[u]; e; e = ne[e]) {
    int v = vel[e];
    if (vis[v] || v == fa) continue;
    get_rt(v, u);
    maxn = max(maxn, siz[v]);
    siz[u] += siz[v];
  }
  maxn = max(maxn, sizd - siz[u]);
  if (mn > maxn) mn = maxn, rt = u;
}
void calc(int u, int fa, int top, long long dep) {
  sum[top] += sqrt(dep) * a[u];
  for (int e = head[u]; e; e = ne[e]) {
    int v = vel[e];
    if (v == fa) continue;
    calc(v, u, top, dep + key[e]);
  }
}
void solve(int u, int fa, long long dep) {
  double num = sqrt(dep);
  sumt += num * dep * a[u];
  for (int e = head[u]; e; e = ne[e]) {
    int v = vel[e];
    if (v == fa) continue;
    solve(v, u, dep + key[e]);
  }
}
void get_siz(int u, int fa) {
  siz[u] = 1;
  for (int e = head[u]; e; e = ne[e]) {
    int v = vel[e];
    if (v == fa || vis[v]) continue;
    get_siz(v, u);
    siz[u] += siz[v];
  }
}
void dfs(int u, int fa) {
  mn = sizd;
  rt = u;
  get_rt(u, fa);
  get_siz(rt, fa);
  vis[rt] = 1;
  sumt = 0;
  solve(rt, -1, 0);
  if (sumt < anss) anss = sumt, ans = rt;
  double sums = 0;
  for (int e = head[rt]; e; e = ne[e]) {
    int v = vel[e];
    sum[v] = 0;
    calc(v, rt, v, key[e]);
    sums += sum[v];
  }
  for (int e = head[rt]; e; e = ne[e]) {
    int v = vel[e];
    if (vis[v]) continue;
    if ((sums - sum[v]) - sum[v] < 0) {
      sizd = siz[v];
      dfs(v, rt);
      return;
    }
  }
}
int main() {
  n = read();
  anss = 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);
  }
  sizd = n;
  dfs(1, -1);
  printf("%d %.8f\n", ans, anss);
}
